Theorem tfrlem3-2d 6521

Description: Lemma for transfinite recursion which changes a bound variable (Contributed by Jim Kingdon, 2-Jul-2019.)

Hypothesis

Ref	Expression
tfrlem3-2d.1	⊢ (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V))

Assertion

Ref	Expression
tfrlem3-2d	⊢ (𝜑 → (Fun 𝐹 ∧ (𝐹‘𝑔) ∈ V))

Distinct variable group:   𝑥,𝑔,𝐹

Allowed substitution hints:   𝜑(𝑥,𝑔)

Proof of Theorem tfrlem3-2d

Step	Hyp	Ref	Expression
1		tfrlem3-2d.1	. . 3 ⊢ (𝜑 → ∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V))
2		fveq2 5648	. . . . . 6 ⊢ (𝑥 = 𝑔 → (𝐹‘𝑥) = (𝐹‘𝑔))
3	2	eleq1d 2300	. . . . 5 ⊢ (𝑥 = 𝑔 → ((𝐹‘𝑥) ∈ V ↔ (𝐹‘𝑔) ∈ V))
4	3	anbi2d 464	. . . 4 ⊢ (𝑥 = 𝑔 → ((Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V) ↔ (Fun 𝐹 ∧ (𝐹‘𝑔) ∈ V)))
5	4	cbvalv 1966	. . 3 ⊢ (∀𝑥(Fun 𝐹 ∧ (𝐹‘𝑥) ∈ V) ↔ ∀𝑔(Fun 𝐹 ∧ (𝐹‘𝑔) ∈ V))
6	1, 5	sylib 122	. 2 ⊢ (𝜑 → ∀𝑔(Fun 𝐹 ∧ (𝐹‘𝑔) ∈ V))
7	6	19.21bi 1607	1 ⊢ (𝜑 → (Fun 𝐹 ∧ (𝐹‘𝑔) ∈ V))

Syntax hints:   → wi 4   ∧ wa 104  ∀wal 1396   ∈ wcel 2202  Vcvv 2803  Fun wfun 5327  ‘cfv 5333

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-rex 2517  df-v 2805  df-un 3205  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-iota 5293  df-fv 5341

This theorem is referenced by:  tfrlemisucfn  6533  tfrlemisucaccv  6534  tfrlemibxssdm  6536  tfrlemibfn  6537  tfrlemi14d  6542