Download data/lean/OAI/SetTheory/PartitionPrinciple/Definability/CodedEqualityRelations.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.91 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/SetTheory/PartitionPrinciple/Definability/CodedEqualityRelations.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/SetTheory/PartitionPrinciple/Definability/CodedEqualityRelations.lean
-
curl -L -o CodedEqualityRelations.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/SetTheory/PartitionPrinciple/Definability/CodedEqualityRelations.lean
3.91 kB
| import OAI.SetTheory.PartitionPrinciple.Geometry.GroundEqualityStep | |
| namespace OAI | |
| section | |
| namespace PartitionPilot.Forcing.SetFormula | |
| def tripleMembershipFormula {n : Nat} (p x y r : Fin n) : SetFormula n := | |
| ex (.conj (orderedPairFormula 0 x.succ y.succ) | |
| (pairMembershipFormula p.succ 0 r.succ)) | |
| end PartitionPilot.Forcing.SetFormula | |
| namespace PartitionPilot.Forcing.Name | |
| open SetRealization | |
| universe u | |
| variable {P : Type u} (s : Presentation P) | |
| def codedEqualityRelation (S : ZFSet.{u}) (p : P) (Ο Ο : Name s) : Prop := | |
| ZFSet.pair (s.encode p) (ZFSet.pair Ο.val Ο.val) β S | |
| theorem codedEqualityRelation_mono {S T : ZFSet.{u}} (h : S β T) (p : P) (Ο Ο : Name s) : | |
| codedEqualityRelation s S p Ο Ο β codedEqualityRelation s T p Ο Ο := | |
| fun member => h member | |
| end PartitionPilot.Forcing.Name | |
| namespace PartitionPilot.Forcing.TransitiveGround | |
| open SetRealization SetFormula | |
| universe u | |
| variable (M : TransitiveGround.{u}) | |
| theorem realize_tripleMembershipFormula | |
| (pairing : Realize M.sets SetFormula.pairing Fin.elim0) | |
| {n : Nat} (p x y r : Fin n) (env : Fin n β ZFSet.{u}) | |
| (hp : env p β M.sets) (hx : env x β M.sets) | |
| (hy : env y β M.sets) (hr : env r β M.sets) : | |
| Realize M.sets (tripleMembershipFormula p x y r) env β | |
| ZFSet.pair (env p) (ZFSet.pair (env x) (env y)) β env r := by | |
| rw [tripleMembershipFormula, realize_ex] | |
| constructor | |
| Β· rintro β¨z, hz, shape, memberβ© | |
| have eq := (M.realize_orderedPairFormula pairing 0 x.succ y.succ | |
| (extend z env) hz hx hy).1 shape | |
| have raw := (M.realize_pairMembershipFormula pairing p.succ 0 r.succ | |
| (extend z env) hp hz hr).1 member | |
| change z = ZFSet.pair (env x) (env y) at eq | |
| change ZFSet.pair (env p) z β env r at raw | |
| exact eq βΈ raw | |
| Β· intro member | |
| have hz := M.orderedPair_mem pairing hx hy | |
| refine β¨ZFSet.pair (env x) (env y), hz, ?_, ?_β© | |
| Β· exact (M.realize_orderedPairFormula pairing 0 x.succ y.succ | |
| (extend (ZFSet.pair (env x) (env y)) env) hz hx hy).2 rfl | |
| Β· exact (M.realize_pairMembershipFormula pairing p.succ 0 r.succ | |
| (extend (ZFSet.pair (env x) (env y)) env) hp hz hr).2 member | |
| variable {P : Type u} (s : Presentation P) | |
| theorem relationMeaning_coded (D : Name.NameDomain s) | |
| (ground : β Ο β D.names, Ο.val β M.sets) | |
| (pairing : Realize M.sets SetFormula.pairing Fin.elim0) | |
| (carrier : s.carrier β M.sets) | |
| {k : Nat} (r : Fin k) (constants : Fin k β ZFSet.{u}) | |
| (hr : constants r β M.sets) : | |
| M.RelationMeaning s D (Name.codedEqualityRelation s (constants r)) | |
| (tripleMembershipFormula 0 1 2 r.succ.succ.succ) constants := by | |
| intro p Ο Ο | |
| exact M.realize_tripleMembershipFormula pairing 0 1 2 r.succ.succ.succ _ | |
| (M.transitive carrier (s.encode_mem p)) (ground Ο.val Ο.property) | |
| (ground Ο.val Ο.property) hr | |
| theorem coded_postfixed_sound [Preorder P] (D : Name.NameDomain s) (S : ZFSet.{u}) | |
| (post : β Ο β D.names, β Ο β D.names, β p, | |
| Name.codedEqualityRelation s S p Ο Ο β | |
| Name.EqualityStep (Name.codedEqualityRelation s S) p Ο Ο) | |
| {Ο Ο : Name s} (hΟ : Ο β D.names) (hΟ : Ο β D.names) (p : P) : | |
| Name.codedEqualityRelation s S p Ο Ο β Name.ForcesEq p Ο Ο := | |
| Name.postfixed_equality_sound D (Name.codedEqualityRelation s S) post Ο hΟ Ο hΟ p | |
| theorem coded_fixed_iff [Preorder P] (D : Name.NameDomain s) (S : ZFSet.{u}) | |
| (fixed : β Ο β D.names, β Ο β D.names, β p, | |
| Name.codedEqualityRelation s S p Ο Ο β | |
| Name.EqualityStep (Name.codedEqualityRelation s S) p Ο Ο) | |
| {Ο Ο : Name s} (hΟ : Ο β D.names) (hΟ : Ο β D.names) (p : P) : | |
| Name.codedEqualityRelation s S p Ο Ο β Name.ForcesEq p Ο Ο := | |
| Name.fixed_equality_iff D (Name.codedEqualityRelation s S) fixed hΟ hΟ p | |
| end PartitionPilot.Forcing.TransitiveGround | |
| end | |
| end OAI | |