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

Theorem tfr1onlem3 6007
Description: Lemma for transfinite recursion. This lemma changes some bound variables in 𝐴 (version of tfrlem3 5980 but for tfr1on 6019 related lemmas). (Contributed by Jim Kingdon, 14-Mar-2022.)
Hypothesis
Ref Expression
tfr1onlem3ag.1 𝐴 = {𝑓 ∣ ∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
Assertion
Ref Expression
tfr1onlem3 𝐴 = {𝑔 ∣ ∃𝑧𝑋 (𝑔 Fn 𝑧 ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐺‘(𝑔𝑤)))}
Distinct variable groups:   𝑓,𝐺,𝑤,𝑥,𝑦,𝑧   𝑓,𝑋,𝑥,𝑧   𝐴,𝑔   𝑓,𝑔,𝑤,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧,𝑤,𝑓)   𝐺(𝑔)   𝑋(𝑦,𝑤,𝑔)

Proof of Theorem tfr1onlem3
StepHypRef Expression
1 vex 2613 . . 3 𝑔 ∈ V
2 tfr1onlem3ag.1 . . . 4 𝐴 = {𝑓 ∣ ∃𝑥𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝐺‘(𝑓𝑦)))}
32tfr1onlem3ag 6006 . . 3 (𝑔 ∈ V → (𝑔𝐴 ↔ ∃𝑧𝑋 (𝑔 Fn 𝑧 ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐺‘(𝑔𝑤)))))
41, 3ax-mp 7 . 2 (𝑔𝐴 ↔ ∃𝑧𝑋 (𝑔 Fn 𝑧 ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐺‘(𝑔𝑤))))
54abbi2i 2197 1 𝐴 = {𝑔 ∣ ∃𝑧𝑋 (𝑔 Fn 𝑧 ∧ ∀𝑤𝑧 (𝑔𝑤) = (𝐺‘(𝑔𝑤)))}
Colors of variables: wff set class
Syntax hints:  wa 102  wb 103   = wceq 1285  wcel 1434  {cab 2069  wral 2353  wrex 2354  Vcvv 2610  cres 4393   Fn wfn 4947  cfv 4952
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1688  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ral 2358  df-rex 2359  df-v 2612  df-un 2986  df-in 2988  df-ss 2995  df-sn 3422  df-pr 3423  df-op 3425  df-uni 3622  df-br 3806  df-opab 3860  df-xp 4397  df-rel 4398  df-cnv 4399  df-co 4400  df-dm 4401  df-res 4403  df-iota 4917  df-fun 4954  df-fn 4955  df-fv 4960
This theorem is referenced by:  tfr1on  6019
  Copyright terms: Public domain W3C validator