Theorem tfr1onlem3ag 6422

Description: Lemma for transfinite recursion. This lemma changes some bound variables in 𝐴 (version of tfrlem3ag 6394 but for tfr1on 6435 related lemmas). (Contributed by Jim Kingdon, 13-Mar-2022.)

Hypothesis

Ref	Expression
tfr1onlem3ag.1	⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}

Assertion

Ref	Expression
tfr1onlem3ag	⊢ (𝐻 ∈ 𝑉 → (𝐻 ∈ 𝐴 ↔ ∃𝑧 ∈ 𝑋 (𝐻 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝐻‘𝑤) = (𝐺‘(𝐻 ↾ 𝑤)))))

Distinct variable groups:   𝑓,𝐺,𝑤,𝑥,𝑦,𝑧   𝑓,𝐻,𝑤,𝑥,𝑦,𝑧   𝑓,𝑋,𝑥,𝑧

Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧,𝑤,𝑓)   𝑉(𝑥,𝑦,𝑧,𝑤,𝑓)   𝑋(𝑦,𝑤)

Proof of Theorem tfr1onlem3ag

Step	Hyp	Ref	Expression
1		fneq12 5366	. . . 4 ⊢ ((𝑓 = 𝐻 ∧ 𝑥 = 𝑧) → (𝑓 Fn 𝑥 ↔ 𝐻 Fn 𝑧))
2		simpll 527	. . . . . . 7 ⊢ (((𝑓 = 𝐻 ∧ 𝑥 = 𝑧) ∧ 𝑦 = 𝑤) → 𝑓 = 𝐻)
3		simpr 110	. . . . . . 7 ⊢ (((𝑓 = 𝐻 ∧ 𝑥 = 𝑧) ∧ 𝑦 = 𝑤) → 𝑦 = 𝑤)
4	2, 3	fveq12d 5582	. . . . . 6 ⊢ (((𝑓 = 𝐻 ∧ 𝑥 = 𝑧) ∧ 𝑦 = 𝑤) → (𝑓‘𝑦) = (𝐻‘𝑤))
5	2, 3	reseq12d 4959	. . . . . . 7 ⊢ (((𝑓 = 𝐻 ∧ 𝑥 = 𝑧) ∧ 𝑦 = 𝑤) → (𝑓 ↾ 𝑦) = (𝐻 ↾ 𝑤))
6	5	fveq2d 5579	. . . . . 6 ⊢ (((𝑓 = 𝐻 ∧ 𝑥 = 𝑧) ∧ 𝑦 = 𝑤) → (𝐺‘(𝑓 ↾ 𝑦)) = (𝐺‘(𝐻 ↾ 𝑤)))
7	4, 6	eqeq12d 2219	. . . . 5 ⊢ (((𝑓 = 𝐻 ∧ 𝑥 = 𝑧) ∧ 𝑦 = 𝑤) → ((𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)) ↔ (𝐻‘𝑤) = (𝐺‘(𝐻 ↾ 𝑤))))
8		simplr 528	. . . . 5 ⊢ (((𝑓 = 𝐻 ∧ 𝑥 = 𝑧) ∧ 𝑦 = 𝑤) → 𝑥 = 𝑧)
9	7, 8	cbvraldva2 2744	. . . 4 ⊢ ((𝑓 = 𝐻 ∧ 𝑥 = 𝑧) → (∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)) ↔ ∀𝑤 ∈ 𝑧 (𝐻‘𝑤) = (𝐺‘(𝐻 ↾ 𝑤))))
10	1, 9	anbi12d 473	. . 3 ⊢ ((𝑓 = 𝐻 ∧ 𝑥 = 𝑧) → ((𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))) ↔ (𝐻 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝐻‘𝑤) = (𝐺‘(𝐻 ↾ 𝑤)))))
11	10	cbvrexdva 2747	. 2 ⊢ (𝑓 = 𝐻 → (∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))) ↔ ∃𝑧 ∈ 𝑋 (𝐻 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝐻‘𝑤) = (𝐺‘(𝐻 ↾ 𝑤)))))
12		tfr1onlem3ag.1	. 2 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}
13	11, 12	elab2g 2919	1 ⊢ (𝐻 ∈ 𝑉 → (𝐻 ∈ 𝐴 ↔ ∃𝑧 ∈ 𝑋 (𝐻 Fn 𝑧 ∧ ∀𝑤 ∈ 𝑧 (𝐻‘𝑤) = (𝐺‘(𝐻 ↾ 𝑤)))))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1372   ∈ wcel 2175  {cab 2190  ∀wral 2483  ∃wrex 2484   ↾ cres 4676   Fn wfn 5265  ‘cfv 5270

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 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-ext 2186

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-un 3169  df-in 3171  df-ss 3178  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-res 4686  df-iota 5231  df-fun 5272  df-fn 5273  df-fv 5278

This theorem is referenced by:  tfr1onlem3  6423  tfr1onlemsucaccv  6426  tfr1onlembxssdm  6428  tfr1onlemres  6434