Theorem tfr1onlem3 6484

Description: Lemma for transfinite recursion. This lemma changes some bound variables in 𝐴 (version of tfrlem3 6457 but for tfr1on 6496 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

Step	Hyp	Ref	Expression
1		vex 2802	. . 3 ⊢ 𝑔 ∈ V
2		tfr1onlem3ag.1	. . . 4 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
3	2	tfr1onlem3ag 6483	. . 3 ⊢ (𝑔 ∈ V → (𝑔 ∈ 𝐴 ↔ ∃𝑧 ∈ 𝑋 (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤)))))
4	1, 3	ax-mp 5	. 2 ⊢ (𝑔 ∈ 𝐴 ↔ ∃𝑧 ∈ 𝑋 (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤))))
5	4	abbi2i 2344	1 ⊢ 𝐴 = {𝑔 ∣ ∃𝑧 ∈ 𝑋 (𝑔 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝑔‘𝑤) = (𝐺‘(𝑔 ↾ 𝑤)))}

Syntax hints:   ∧ wa 104   ↔ wb 105   = wceq 1395   ∈ wcel 2200  {cab 2215  ∀wral 2508  ∃wrex 2509  Vcvv 2799   ↾ cres 4721   Fn wfn 5313  ‘cfv 5318

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-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-res 4731  df-iota 5278  df-fun 5320  df-fn 5321  df-fv 5326

This theorem is referenced by:  tfr1on  6496