Download data/lean/OAI/Computability/DegreeRigidity/Syntax/FiniteTerm.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.93 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Syntax/FiniteTerm.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/DegreeRigidity/Syntax/FiniteTerm.lean
-
curl -L -o FiniteTerm.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DegreeRigidity/Syntax/FiniteTerm.lean
4.93 kB
| import OAI.Computability.DegreeRigidity.Effective.FiniteCodeBound | |
| import Mathlib.SetTheory.ZFC.Rank | |
| namespace OAI | |
| namespace TuringRigidity.BoundedSetTheory | |
| open TransitiveNameModel | |
| universe u | |
| namespace FiniteTerm | |
| noncomputable def tag (n : β) (x : ZFSet.{u}) : ZFSet.{u} := ZFSet.pair (natSet n) x | |
| theorem tag_inj (n m : β) (x y : ZFSet.{u}) : tag n x = tag m y β n = m β§ x = y := by | |
| rw [tag,tag,ZFSet.pair_inj] | |
| exact and_congr β¨fun h => natSet_injective h,fun h => congrArg natSet hβ© Iff.rfl | |
| inductive Eval (A B L O D : ZFSet.{u}) : ZFSet.{u} β ZFSet.{u} β Prop | |
| | leaf {a x : ZFSet.{u}} : a β A β x β D β ZFSet.pair a x β L β Eval A B L O D (tag 0 a) x | |
| | app {o c x y : ZFSet.{u}} : o β B β Eval A B L O D c x β y β D β | |
| ZFSet.pair (ZFSet.pair o x) y β O β Eval A B L O D (tag 1 (ZFSet.pair o c)) y | |
| | pair {a b x y : ZFSet.{u}} : Eval A B L O D a x β Eval A B L O D b y β | |
| ZFSet.pair x y β D β Eval A B L O D (tag 2 (ZFSet.pair a b)) (ZFSet.pair x y) | |
| theorem Eval.value_mem {A B L O D c x : ZFSet.{u}} (h : Eval A B L O D c x) : x β D := by | |
| cases h with | |
| | leaf _ hx _ => exact hx | |
| | app _ _ hx _ => exact hx | |
| | pair _ _ hx => exact hx | |
| theorem Eval.code_finite {A B L O D t c x : ZFSet.{u}} | |
| (hA : A β t) (hB : B β t) (hn : β n, natSet.{u} n β t) | |
| (h : Eval A B L O D c x) : FiniteTuple.FiniteCode t c := by | |
| induction h with | |
| | leaf ha _ _ => exact (FiniteTuple.FiniteCode.atom _ (hn 0)).orderedPair (.atom _ (hA ha)) | |
| | app ho _ _ _ ih => | |
| exact (FiniteTuple.FiniteCode.atom _ (hn 1)).orderedPair | |
| ((FiniteTuple.FiniteCode.atom _ (hB ho)).orderedPair ih) | |
| | pair _ _ _ iha ihb => exact (FiniteTuple.FiniteCode.atom _ (hn 2)).orderedPair (iha.orderedPair ihb) | |
| def Step (A B L O K D f c v : ZFSet.{u}) : Prop := | |
| (β a β A, c = tag 0 a β§ ZFSet.pair a v β L) β¨ | |
| (β o β B, β a β K, β x β D, c = tag 1 (ZFSet.pair o a) β§ | |
| ZFSet.pair a x β f β§ ZFSet.pair (ZFSet.pair o x) v β O) β¨ | |
| (β a β K, β b β K, β x β D, β y β D, c = tag 2 (ZFSet.pair a b) β§ | |
| ZFSet.pair a x β f β§ ZFSet.pair b y β f β§ v = ZFSet.pair x y) | |
| def Certificate (A B L O K D f : ZFSet.{u}) : Prop := | |
| β z β f, β c β K, β v β D, z = ZFSet.pair c v β§ Step A B L O K D f c v | |
| theorem Step.mono {A B L O K D f g c v : ZFSet.{u}} (hfg : f β g) | |
| (h : Step A B L O K D f c v) : Step A B L O K D g c v := by | |
| rcases h with h|h|h | |
| Β· exact Or.inl h | |
| Β· obtain β¨o,ho,a,ha,x,hx,hc,hax,hoxβ© := h | |
| exact Or.inr (Or.inl β¨o,ho,a,ha,x,hx,hc,hfg hax,hoxβ©) | |
| Β· obtain β¨a,ha,b,hb,x,hx,y,hy,hc,hax,hby,hvβ© := h | |
| exact Or.inr (Or.inr β¨a,ha,b,hb,x,hx,y,hy,hc,hfg hax,hfg hby,hvβ©) | |
| theorem Certificate.subset {A B L O K D f : ZFSet.{u}} (hf : Certificate A B L O K D f) : | |
| f β ZFSet.prod K D := by | |
| intro z hz | |
| obtain β¨c,hc,v,hv,hz,_β© := hf z hz | |
| exact ZFSet.mem_prod.mpr β¨c,hc,v,hv,hzβ© | |
| theorem Certificate.step {A B L O K D f c v : ZFSet.{u}} | |
| (hf : Certificate A B L O K D f) (hp : ZFSet.pair c v β f) : | |
| c β K β§ v β D β§ Step A B L O K D f c v := by | |
| obtain β¨c',hc,v',hv,he,hsβ© := hf _ hp | |
| obtain β¨rfl,rflβ© := ZFSet.pair_inj.mp he | |
| exact β¨hc,hv,hsβ© | |
| theorem pair_rank_left (x y : ZFSet.{u}) : ZFSet.rank x < ZFSet.rank (ZFSet.pair x y) := by | |
| have ha : x β ({x,y} : ZFSet.{u}) := ZFSet.mem_pair.mpr (Or.inl rfl) | |
| have hb : ({x,y} : ZFSet.{u}) β ZFSet.pair x y := ZFSet.mem_pair.mpr (Or.inr rfl) | |
| exact (ZFSet.rank_lt_of_mem ha).trans (ZFSet.rank_lt_of_mem hb) | |
| theorem pair_rank_right (x y : ZFSet.{u}) : ZFSet.rank y < ZFSet.rank (ZFSet.pair x y) := by | |
| have ha : y β ({x,y} : ZFSet.{u}) := ZFSet.mem_pair.mpr (Or.inr rfl) | |
| have hb : ({x,y} : ZFSet.{u}) β ZFSet.pair x y := ZFSet.mem_pair.mpr (Or.inr rfl) | |
| exact (ZFSet.rank_lt_of_mem ha).trans (ZFSet.rank_lt_of_mem hb) | |
| theorem Certificate.sound {A B L O K D f : ZFSet.{u}} | |
| (hf : Certificate A B L O K D f) (c v : ZFSet.{u}) | |
| (hp : ZFSet.pair c v β f) : Eval A B L O D c v := by | |
| have wf : WellFounded (fun a b : ZFSet.{u} => ZFSet.rank a < ZFSet.rank b) := | |
| InvImage.wf ZFSet.rank Ordinal.lt_wf | |
| induction c using wf.induction generalizing v with | |
| | h c ih => | |
| have hv := (hf.step hp).2.1 | |
| rcases (hf.step hp).2.2 with h|h|h | |
| Β· obtain β¨a,ha,rfl,havβ© := h | |
| exact .leaf ha hv hav | |
| Β· obtain β¨o,ho,a,_,x,_,rfl,hax,hovβ© := h | |
| have hlt := (pair_rank_right o a).trans (pair_rank_right (natSet 1) (ZFSet.pair o a)) | |
| exact .app ho (ih a hlt x hax) hv hov | |
| Β· obtain β¨a,_,b,_,x,_,y,_,rfl,hax,hby,rflβ© := h | |
| have ha := (pair_rank_left a b).trans (pair_rank_right (natSet 2) (ZFSet.pair a b)) | |
| have hb := (pair_rank_right a b).trans (pair_rank_right (natSet 2) (ZFSet.pair a b)) | |
| exact .pair (ih a ha x hax) (ih b hb y hby) hv | |
| end FiniteTerm | |
| end TuringRigidity.BoundedSetTheory | |
| end OAI | |