Theorem ralxfrALT 4613

Description: Transfer universal quantification from a variable 𝑥 to another variable 𝑦 contained in expression 𝐴. This proof does not use ralxfrd 4608. (Contributed by NM, 10-Jun-2005.) (Revised by Mario Carneiro, 15-Aug-2014.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
ralxfr.1	⊢ (𝑦 ∈ 𝐶 → 𝐴 ∈ 𝐵)
ralxfr.2	⊢ (𝑥 ∈ 𝐵 → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴)
ralxfr.3	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
ralxfrALT	⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐶 𝜓)

Distinct variable groups:   𝜓,𝑥   𝜑,𝑦   𝑥,𝐴   𝑥,𝑦,𝐵   𝑥,𝐶

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝐴(𝑦)   𝐶(𝑦)

Proof of Theorem ralxfrALT

Step	Hyp	Ref	Expression
1		ralxfr.1	. . . . 5 ⊢ (𝑦 ∈ 𝐶 → 𝐴 ∈ 𝐵)
2		ralxfr.3	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
3	2	rspcv 2925	. . . . 5 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → 𝜓))
4	1, 3	syl 14	. . . 4 ⊢ (𝑦 ∈ 𝐶 → (∀𝑥 ∈ 𝐵 𝜑 → 𝜓))
5	4	com12 30	. . 3 ⊢ (∀𝑥 ∈ 𝐵 𝜑 → (𝑦 ∈ 𝐶 → 𝜓))
6	5	ralrimiv 2622	. 2 ⊢ (∀𝑥 ∈ 𝐵 𝜑 → ∀𝑦 ∈ 𝐶 𝜓)
7		ralxfr.2	. . . 4 ⊢ (𝑥 ∈ 𝐵 → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴)
8		nfra1 2581	. . . . 5 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐶 𝜓
9		nfv 1581	. . . . 5 ⊢ Ⅎ𝑦𝜑
10		rsp 2597	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐶 𝜓 → (𝑦 ∈ 𝐶 → 𝜓))
11	2	biimprcd 160	. . . . . 6 ⊢ (𝜓 → (𝑥 = 𝐴 → 𝜑))
12	10, 11	syl6 33	. . . . 5 ⊢ (∀𝑦 ∈ 𝐶 𝜓 → (𝑦 ∈ 𝐶 → (𝑥 = 𝐴 → 𝜑)))
13	8, 9, 12	rexlimd 2665	. . . 4 ⊢ (∀𝑦 ∈ 𝐶 𝜓 → (∃𝑦 ∈ 𝐶 𝑥 = 𝐴 → 𝜑))
14	7, 13	syl5 32	. . 3 ⊢ (∀𝑦 ∈ 𝐶 𝜓 → (𝑥 ∈ 𝐵 → 𝜑))
15	14	ralrimiv 2622	. 2 ⊢ (∀𝑦 ∈ 𝐶 𝜓 → ∀𝑥 ∈ 𝐵 𝜑)
16	6, 15	impbii 126	1 ⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐶 𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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-ext 2220

This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823

This theorem is used by: (None)