Download data/lean/OAI/SetTheory/PartitionPrinciple/Definability/BoundedDirectedOrders.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.27 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/SetTheory/PartitionPrinciple/Definability/BoundedDirectedOrders.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/SetTheory/PartitionPrinciple/Definability/BoundedDirectedOrders.lean
-
curl -L -o BoundedDirectedOrders.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/SetTheory/PartitionPrinciple/Definability/BoundedDirectedOrders.lean
2.27 kB
| import OAI.SetTheory.PartitionPrinciple.Geometry.GroundContainmentOrders | |
| namespace OAI | |
| section | |
| namespace PartitionPilot.Forcing.BoundedFormula | |
| open SetFormula | |
| universe u | |
| def upwardDirectedFormula {n} (l r : Fin n) : BoundedFormula n := | |
| .allMem l (.allMem l.succ (exMem l.succ.succ | |
| (.conj (pairMembershipFormula 2 0 r.succ.succ.succ) | |
| (pairMembershipFormula 1 0 r.succ.succ.succ)))) | |
| theorem truth_upwardDirectedFormula {n} (l r : Fin n) (env : Fin n β ZFSet.{u}) : | |
| Truth (upwardDirectedFormula l r) env β | |
| β x β env l, β y β env l, β z β env l, | |
| ZFSet.pair x z β env r β§ ZFSet.pair y z β env r := by | |
| simp only [upwardDirectedFormula, Truth, truth_exMem, truth_pairMembershipFormula] | |
| rfl | |
| end PartitionPilot.Forcing.BoundedFormula | |
| namespace PartitionPilot.Forcing.TransitiveGround | |
| open SetRealization SetFormula | |
| universe u | |
| variable (M : TransitiveGround.{u}) | |
| theorem realize_upwardDirectedCode {L R : ZFSet.{u}} (hL : L β M.sets) (hR : R β M.sets) : | |
| Realize M.sets (BoundedFormula.upwardDirectedFormula 0 1).toFormula | |
| (extend L (extend R Fin.elim0)) β | |
| β x β L, β y β L, β z β L, ZFSet.pair x z β R β§ ZFSet.pair y z β R := | |
| (BoundedFormula.realize_toFormula M _ _ | |
| (Fin.cases hL (Fin.cases hR (fun j => Fin.elim0 j)))).trans | |
| (BoundedFormula.truth_upwardDirectedFormula 0 1 _) | |
| theorem decoded_upward_directed {L R : ZFSet.{u}} (order : PartialOrderCode L R) | |
| (hL : L β M.sets) (hR : R β M.sets) | |
| (laws : Realize M.sets (BoundedFormula.upwardDirectedFormula 0 1).toFormula | |
| (extend L (extend R Fin.elim0))) : | |
| letI := order.toPartialOrder | |
| β C D : SetMembers L, β E, C β€ E β§ D β€ E := by | |
| let := order.toPartialOrder | |
| intro C D | |
| obtain β¨z, hz, cz, dzβ© := (M.realize_upwardDirectedCode hL hR).1 laws | |
| _ (SetMembers.raw_mem C) _ (SetMembers.raw_mem D) | |
| refine β¨SetMembers.ofMem z hz, ?_, ?_β© | |
| Β· change ZFSet.pair (SetMembers.raw C) (SetMembers.raw (SetMembers.ofMem z hz)) β R | |
| rw [SetMembers.raw_ofMem] | |
| exact cz | |
| Β· change ZFSet.pair (SetMembers.raw D) (SetMembers.raw (SetMembers.ofMem z hz)) β R | |
| rw [SetMembers.raw_ofMem] | |
| exact dz | |
| end PartitionPilot.Forcing.TransitiveGround | |
| end | |
| end OAI | |