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

Theorem tfr1onlemex 6347
Description: Lemma for tfr1on 6350. (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 6345 . . 3 (𝜑𝐵 ∈ V)
11 uniexg 4439 . . 3 (𝐵 ∈ V → 𝐵 ∈ V)
1210, 11syl 14 . 2 (𝜑 𝐵 ∈ V)
131, 2, 3, 4, 5, 6, 7, 8, 9tfr1onlembfn 6344 . . 3 (𝜑 𝐵 Fn 𝐷)
141, 2, 3, 4, 5, 6, 7, 8, 9tfr1onlemubacc 6346 . . 3 (𝜑 → ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢)))
1513, 14jca 306 . 2 (𝜑 → ( 𝐵 Fn 𝐷 ∧ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))))
16 fneq1 5304 . . . 4 (𝑓 = 𝐵 → (𝑓 Fn 𝐷 𝐵 Fn 𝐷))
17 fveq1 5514 . . . . . 6 (𝑓 = 𝐵 → (𝑓𝑢) = ( 𝐵𝑢))
18 reseq1 4901 . . . . . . 7 (𝑓 = 𝐵 → (𝑓𝑢) = ( 𝐵𝑢))
1918fveq2d 5519 . . . . . 6 (𝑓 = 𝐵 → (𝐺‘(𝑓𝑢)) = (𝐺‘( 𝐵𝑢)))
2017, 19eqeq12d 2192 . . . . 5 (𝑓 = 𝐵 → ((𝑓𝑢) = (𝐺‘(𝑓𝑢)) ↔ ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))))
2120ralbidv 2477 . . . 4 (𝑓 = 𝐵 → (∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢)) ↔ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))))
2216, 21anbi12d 473 . . 3 (𝑓 = 𝐵 → ((𝑓 Fn 𝐷 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢))) ↔ ( 𝐵 Fn 𝐷 ∧ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢)))))
2322spcegv 2825 . 2 ( 𝐵 ∈ V → (( 𝐵 Fn 𝐷 ∧ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))) → ∃𝑓(𝑓 Fn 𝐷 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢)))))
2412, 15, 23sylc 62 1 (𝜑 → ∃𝑓(𝑓 Fn 𝐷 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 978   = wceq 1353  wex 1492  wcel 2148  {cab 2163  wral 2455  wrex 2456  Vcvv 2737  cun 3127  {csn 3592  cop 3595   cuni 3809  Ord word 4362  suc csuc 4365  cres 4628  Fun wfun 5210   Fn wfn 5211  cfv 5216  recscrecs 6304
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4118  ax-sep 4121  ax-pow 4174  ax-pr 4209  ax-un 4433  ax-setind 4536
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-iun 3888  df-br 4004  df-opab 4065  df-mpt 4066  df-tr 4102  df-id 4293  df-iord 4366  df-on 4368  df-suc 4371  df-xp 4632  df-rel 4633  df-cnv 4634  df-co 4635  df-dm 4636  df-rn 4637  df-res 4638  df-ima 4639  df-iota 5178  df-fun 5218  df-fn 5219  df-f 5220  df-f1 5221  df-fo 5222  df-f1o 5223  df-fv 5224  df-recs 6305
This theorem is referenced by:  tfr1onlemaccex  6348
  Copyright terms: Public domain W3C validator