ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  tfr1onlemex GIF version

Theorem tfr1onlemex 6402
Description: Lemma for tfr1on 6405. (Contributed by Jim Kingdon, 16-Mar-2022.)
Hypotheses
Ref Expression
tfr1on.f 𝐹 = recs(𝐺)
tfr1on.g (𝜑 → Fun 𝐺)
tfr1on.x (𝜑 → Ord 𝑋)
tfr1on.ex ((𝜑𝑥𝑋𝑓 Fn 𝑥) → (𝐺𝑓) ∈ V)
tfr1onlemsucfn.1 𝐴 = {𝑓 ∣ ∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
tfr1onlembacc.3 𝐵 = { ∣ ∃𝑧𝐷𝑔(𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐺𝑔)⟩}))}
tfr1onlembacc.u ((𝜑𝑥 𝑋) → suc 𝑥𝑋)
tfr1onlembacc.4 (𝜑𝐷𝑋)
tfr1onlembacc.5 (𝜑 → ∀𝑧𝐷𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐺‘(𝑔𝑤))))
Assertion
Ref Expression
tfr1onlemex (𝜑 → ∃𝑓(𝑓 Fn 𝐷 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢))))
Distinct variable groups:   𝐴,𝑓,𝑔,,𝑥,𝑧   𝐷,𝑓,𝑔,𝑥   𝑓,𝐺,𝑥,𝑦   𝑓,𝑋,𝑥   𝜑,𝑓,𝑔,,𝑥,𝑧   𝑦,𝑔,𝑧   𝐵,𝑓,𝑔,,𝑤,𝑧   𝑢,𝐵,𝑓,𝑤   𝐷,,𝑤,𝑧,𝑥   𝑢,𝐷   ,𝐺,𝑧,𝑦   𝑢,𝐺,𝑤   𝑔,𝑋,𝑧   𝜑,𝑤   𝑦,𝑤
Allowed substitution hints:   𝜑(𝑦,𝑢)   𝐴(𝑦,𝑤,𝑢)   𝐵(𝑥,𝑦)   𝐷(𝑦)   𝐹(𝑥,𝑦,𝑧,𝑤,𝑢,𝑓,𝑔,)   𝐺(𝑔)   𝑋(𝑦,𝑤,𝑢,)

Proof of Theorem tfr1onlemex
StepHypRef Expression
1 tfr1on.f . . . 4 𝐹 = recs(𝐺)
2 tfr1on.g . . . 4 (𝜑 → Fun 𝐺)
3 tfr1on.x . . . 4 (𝜑 → Ord 𝑋)
4 tfr1on.ex . . . 4 ((𝜑𝑥𝑋𝑓 Fn 𝑥) → (𝐺𝑓) ∈ V)
5 tfr1onlemsucfn.1 . . . 4 𝐴 = {𝑓 ∣ ∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
6 tfr1onlembacc.3 . . . 4 𝐵 = { ∣ ∃𝑧𝐷𝑔(𝑔 Fn 𝑧𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐺𝑔)⟩}))}
7 tfr1onlembacc.u . . . 4 ((𝜑𝑥 𝑋) → suc 𝑥𝑋)
8 tfr1onlembacc.4 . . . 4 (𝜑𝐷𝑋)
9 tfr1onlembacc.5 . . . 4 (𝜑 → ∀𝑧𝐷𝑔(𝑔 Fn 𝑧 ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐺‘(𝑔𝑤))))
101, 2, 3, 4, 5, 6, 7, 8, 9tfr1onlembex 6400 . . 3 (𝜑𝐵 ∈ V)
11 uniexg 4471 . . 3 (𝐵 ∈ V → 𝐵 ∈ V)
1210, 11syl 14 . 2 (𝜑 𝐵 ∈ V)
131, 2, 3, 4, 5, 6, 7, 8, 9tfr1onlembfn 6399 . . 3 (𝜑 𝐵 Fn 𝐷)
141, 2, 3, 4, 5, 6, 7, 8, 9tfr1onlemubacc 6401 . . 3 (𝜑 → ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢)))
1513, 14jca 306 . 2 (𝜑 → ( 𝐵 Fn 𝐷 ∧ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))))
16 fneq1 5343 . . . 4 (𝑓 = 𝐵 → (𝑓 Fn 𝐷 𝐵 Fn 𝐷))
17 fveq1 5554 . . . . . 6 (𝑓 = 𝐵 → (𝑓𝑢) = ( 𝐵𝑢))
18 reseq1 4937 . . . . . . 7 (𝑓 = 𝐵 → (𝑓𝑢) = ( 𝐵𝑢))
1918fveq2d 5559 . . . . . 6 (𝑓 = 𝐵 → (𝐺‘(𝑓𝑢)) = (𝐺‘( 𝐵𝑢)))
2017, 19eqeq12d 2208 . . . . 5 (𝑓 = 𝐵 → ((𝑓𝑢) = (𝐺‘(𝑓𝑢)) ↔ ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))))
2120ralbidv 2494 . . . 4 (𝑓 = 𝐵 → (∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢)) ↔ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))))
2216, 21anbi12d 473 . . 3 (𝑓 = 𝐵 → ((𝑓 Fn 𝐷 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢))) ↔ ( 𝐵 Fn 𝐷 ∧ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢)))))
2322spcegv 2849 . 2 ( 𝐵 ∈ V → (( 𝐵 Fn 𝐷 ∧ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))) → ∃𝑓(𝑓 Fn 𝐷 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢)))))
2412, 15, 23sylc 62 1 (𝜑 → ∃𝑓(𝑓 Fn 𝐷 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980   = wceq 1364  wex 1503  wcel 2164  {cab 2179  wral 2472  wrex 2473  Vcvv 2760  cun 3152  {csn 3619  cop 3622   cuni 3836  Ord word 4394  suc csuc 4397  cres 4662  Fun wfun 5249   Fn wfn 5250  cfv 5255  recscrecs 6359
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-id 4325  df-iord 4398  df-on 4400  df-suc 4403  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-recs 6360
This theorem is referenced by:  tfr1onlemaccex  6403
  Copyright terms: Public domain W3C validator