Documentation

ZFLean.Def

Core definitions for ZFC set theory #

This file develops basic definitions and lemmas over ZFSet, including transitive and inductive sets, the symmetric difference, and assorted membership and monotonicity results.

A set x is transitive if every element of x is a subset of x: ∀ y ∈ x, y ⊆ x.

Equations
Instances For

    An inductive set is defined as a set that contains the empty set ∅ and is closed under successor.

    The "successor" of a set x is defined as the insertion of x into itself.

    Equations
    Instances For
      theorem ZFSet.prod_nonempty {x y : ZFSet.{u_1}} :
      x ≠ ∅ → y ≠ ∅ → x.prod y ≠ ∅
      theorem ZFSet.inductive_sep {S : ZFSet.{u_1}} (P : ZFSet.{u_1} → Prop) (ind : S.inductive_set) (h₀ : P ∅) (h₁ : ∀ n ∈ S, P n → P (insert n n)) :
      theorem ZFSet.insert_mem {x y : ZFSet.{u_1}} (h : x ∈ y) :
      insert x y = y

      The first Von Neumann ordinal ω is an inductive set.

      Equations
      Instances For
        @[simp]
        theorem ZFSet.mem_symmDiff (x p q : ZFSet.{u_1}) :
        x ∈ p Δ q ↔ x ∈ p ∧ x ∉ q ∨ x ∈ q ∧ x ∉ p
        @[simp]
        theorem ZFSet.symmDiff_comm (p q : ZFSet.{u_1}) :
        p Δ q = q Δ p
        @[simp]
        theorem ZFSet.epsilon_mem {y : ZFSet.{u_1}} (hy : y ≠ ∅) :
        (fun (x : ZFSet.{u_1}) => Classical.epsilon fun (z : ZFSet.{u_1}) => z ∈ x) y ∈ y
        theorem ZFSet.union_mono {x y z : ZFSet.{u_1}} :
        x ⊆ z → y ⊆ z → x ∪ y ⊆ z
        theorem ZFSet.inter_mono {x y z : ZFSet.{u_1}} :
        x ⊆ z → y ⊆ z → x ∩ y ⊆ z