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

Theorem tfrcllemex 6436
Description: Lemma for tfrcl 6440. (Contributed by Jim Kingdon, 26-Mar-2022.)
Hypotheses
Ref Expression
tfrcl.f 𝐹 = recs(𝐺)
tfrcl.g (𝜑 → Fun 𝐺)
tfrcl.x (𝜑 → Ord 𝑋)
tfrcl.ex ((𝜑𝑥𝑋𝑓:𝑥𝑆) → (𝐺𝑓) ∈ 𝑆)
tfrcllemsucfn.1 𝐴 = {𝑓 ∣ ∃𝑥𝑋 (𝑓:𝑥𝑆 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
tfrcllembacc.3 𝐵 = { ∣ ∃𝑧𝐷𝑔(𝑔:𝑧𝑆𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐺𝑔)⟩}))}
tfrcllembacc.u ((𝜑𝑥 𝑋) → suc 𝑥𝑋)
tfrcllembacc.4 (𝜑𝐷𝑋)
tfrcllembacc.5 (𝜑 → ∀𝑧𝐷𝑔(𝑔:𝑧𝑆 ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐺‘(𝑔𝑤))))
Assertion
Ref Expression
tfrcllemex (𝜑 → ∃𝑓(𝑓:𝐷𝑆 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢))))
Distinct variable groups:   𝐴,𝑓,𝑔,,𝑥,𝑦,𝑧   𝐷,𝑓,𝑔,𝑥,𝑦   𝑓,𝐺,𝑥,𝑦   𝑆,𝑓,𝑥,𝑦   𝑓,𝑋,𝑥   𝜑,𝑓,𝑔,,𝑥,𝑦,𝑧   𝐵,𝑓,𝑔,,𝑧   𝑢,𝐵,𝑓   𝑤,𝐵,𝑔,𝑧   𝐷,,𝑧   𝑢,𝐷,𝑤   𝑦,𝑤   ,𝐺,𝑧   𝑢,𝐺,𝑤   𝑆,𝑔,,𝑧   𝑧,𝑋   𝜑,𝑤
Allowed substitution hints:   𝜑(𝑢)   𝐴(𝑤,𝑢)   𝐵(𝑥,𝑦)   𝑆(𝑤,𝑢)   𝐹(𝑥,𝑦,𝑧,𝑤,𝑢,𝑓,𝑔,)   𝐺(𝑔)   𝑋(𝑦,𝑤,𝑢,𝑔,)

Proof of Theorem tfrcllemex
StepHypRef Expression
1 tfrcl.f . . . 4 𝐹 = recs(𝐺)
2 tfrcl.g . . . 4 (𝜑 → Fun 𝐺)
3 tfrcl.x . . . 4 (𝜑 → Ord 𝑋)
4 tfrcl.ex . . . 4 ((𝜑𝑥𝑋𝑓:𝑥𝑆) → (𝐺𝑓) ∈ 𝑆)
5 tfrcllemsucfn.1 . . . 4 𝐴 = {𝑓 ∣ ∃𝑥𝑋 (𝑓:𝑥𝑆 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
6 tfrcllembacc.3 . . . 4 𝐵 = { ∣ ∃𝑧𝐷𝑔(𝑔:𝑧𝑆𝑔𝐴 = (𝑔 ∪ {⟨𝑧, (𝐺𝑔)⟩}))}
7 tfrcllembacc.u . . . 4 ((𝜑𝑥 𝑋) → suc 𝑥𝑋)
8 tfrcllembacc.4 . . . 4 (𝜑𝐷𝑋)
9 tfrcllembacc.5 . . . 4 (𝜑 → ∀𝑧𝐷𝑔(𝑔:𝑧𝑆 ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐺‘(𝑔𝑤))))
101, 2, 3, 4, 5, 6, 7, 8, 9tfrcllembex 6434 . . 3 (𝜑𝐵 ∈ V)
11 uniexg 4484 . . 3 (𝐵 ∈ V → 𝐵 ∈ V)
1210, 11syl 14 . 2 (𝜑 𝐵 ∈ V)
131, 2, 3, 4, 5, 6, 7, 8, 9tfrcllembfn 6433 . . 3 (𝜑 𝐵:𝐷𝑆)
141, 2, 3, 4, 5, 6, 7, 8, 9tfrcllemubacc 6435 . . 3 (𝜑 → ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢)))
1513, 14jca 306 . 2 (𝜑 → ( 𝐵:𝐷𝑆 ∧ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))))
16 feq1 5402 . . . 4 (𝑓 = 𝐵 → (𝑓:𝐷𝑆 𝐵:𝐷𝑆))
17 fveq1 5569 . . . . . 6 (𝑓 = 𝐵 → (𝑓𝑢) = ( 𝐵𝑢))
18 reseq1 4950 . . . . . . 7 (𝑓 = 𝐵 → (𝑓𝑢) = ( 𝐵𝑢))
1918fveq2d 5574 . . . . . 6 (𝑓 = 𝐵 → (𝐺‘(𝑓𝑢)) = (𝐺‘( 𝐵𝑢)))
2017, 19eqeq12d 2219 . . . . 5 (𝑓 = 𝐵 → ((𝑓𝑢) = (𝐺‘(𝑓𝑢)) ↔ ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))))
2120ralbidv 2505 . . . 4 (𝑓 = 𝐵 → (∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢)) ↔ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))))
2216, 21anbi12d 473 . . 3 (𝑓 = 𝐵 → ((𝑓:𝐷𝑆 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢))) ↔ ( 𝐵:𝐷𝑆 ∧ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢)))))
2322spcegv 2860 . 2 ( 𝐵 ∈ V → (( 𝐵:𝐷𝑆 ∧ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))) → ∃𝑓(𝑓:𝐷𝑆 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢)))))
2412, 15, 23sylc 62 1 (𝜑 → ∃𝑓(𝑓:𝐷𝑆 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980   = wceq 1372  wex 1514  wcel 2175  {cab 2190  wral 2483  wrex 2484  Vcvv 2771  cun 3163  {csn 3632  cop 3635   cuni 3849  Ord word 4407  suc csuc 4410  cres 4675  Fun wfun 5262  wf 5264  cfv 5268  recscrecs 6380
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 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-coll 4158  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4478  ax-setind 4583
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-ral 2488  df-rex 2489  df-reu 2490  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-nul 3460  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-tr 4142  df-id 4338  df-iord 4411  df-on 4413  df-suc 4416  df-xp 4679  df-rel 4680  df-cnv 4681  df-co 4682  df-dm 4683  df-rn 4684  df-res 4685  df-ima 4686  df-iota 5229  df-fun 5270  df-fn 5271  df-f 5272  df-f1 5273  df-fo 5274  df-f1o 5275  df-fv 5276  df-recs 6381
This theorem is referenced by:  tfrcllemaccex  6437
  Copyright terms: Public domain W3C validator