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

Theorem tfrcllemex 6621
Description: Lemma for tfrcl 6625. (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 6619 . . 3 (𝜑𝐵 ∈ V)
11 uniexg 4580 . . 3 (𝐵 ∈ V → 𝐵 ∈ V)
1210, 11syl 14 . 2 (𝜑 𝐵 ∈ V)
131, 2, 3, 4, 5, 6, 7, 8, 9tfrcllembfn 6618 . . 3 (𝜑 𝐵:𝐷𝑆)
141, 2, 3, 4, 5, 6, 7, 8, 9tfrcllemubacc 6620 . . 3 (𝜑 → ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢)))
1513, 14jca 306 . 2 (𝜑 → ( 𝐵:𝐷𝑆 ∧ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))))
16 feq1 5511 . . . 4 (𝑓 = 𝐵 → (𝑓:𝐷𝑆 𝐵:𝐷𝑆))
17 fveq1 5689 . . . . . 6 (𝑓 = 𝐵 → (𝑓𝑢) = ( 𝐵𝑢))
18 reseq1 5052 . . . . . . 7 (𝑓 = 𝐵 → (𝑓𝑢) = ( 𝐵𝑢))
1918fveq2d 5694 . . . . . 6 (𝑓 = 𝐵 → (𝐺‘(𝑓𝑢)) = (𝐺‘( 𝐵𝑢)))
2017, 19eqeq12d 2253 . . . . 5 (𝑓 = 𝐵 → ((𝑓𝑢) = (𝐺‘(𝑓𝑢)) ↔ ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))))
2120ralbidv 2550 . . . 4 (𝑓 = 𝐵 → (∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢)) ↔ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))))
2216, 21anbi12d 477 . . 3 (𝑓 = 𝐵 → ((𝑓:𝐷𝑆 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢))) ↔ ( 𝐵:𝐷𝑆 ∧ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢)))))
2322spcegv 2913 . 2 ( 𝐵 ∈ V → (( 𝐵:𝐷𝑆 ∧ ∀𝑢𝐷 ( 𝐵𝑢) = (𝐺‘( 𝐵𝑢))) → ∃𝑓(𝑓:𝐷𝑆 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢)))))
2412, 15, 23sylc 62 1 (𝜑 → ∃𝑓(𝑓:𝐷𝑆 ∧ ∀𝑢𝐷 (𝑓𝑢) = (𝐺‘(𝑓𝑢))))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1009   = wceq 1402  wex 1545  wcel 2209  {cab 2224  wral 2528  wrex 2529  Vcvv 2821  cun 3218  {csn 3705  cop 3708   cuni 3930  Ord word 4502  suc csuc 4505  cres 4771  Fun wfun 5366  wf 5368  cfv 5372  recscrecs 6565
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-recs 6566
This theorem is referenced by:  tfrcllemaccex  6622
  Copyright terms: Public domain W3C validator