Theorem ralxfrALT 5333

Description: Alternate proof of ralxfr 5332 which does not use ralxfrd 5326. (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 3547	. . . . 5 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → 𝜓))
4	1, 3	syl 17	. . . 4 ⊢ (𝑦 ∈ 𝐶 → (∀𝑥 ∈ 𝐵 𝜑 → 𝜓))
5	4	com12 32	. . 3 ⊢ (∀𝑥 ∈ 𝐵 𝜑 → (𝑦 ∈ 𝐶 → 𝜓))
6	5	ralrimiv 3106	. 2 ⊢ (∀𝑥 ∈ 𝐵 𝜑 → ∀𝑦 ∈ 𝐶 𝜓)
7		ralxfr.2	. . . 4 ⊢ (𝑥 ∈ 𝐵 → ∃𝑦 ∈ 𝐶 𝑥 = 𝐴)
8		nfra1 3142	. . . . 5 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐶 𝜓
9		nfv 1918	. . . . 5 ⊢ Ⅎ𝑦𝜑
10		rsp 3129	. . . . . 6 ⊢ (∀𝑦 ∈ 𝐶 𝜓 → (𝑦 ∈ 𝐶 → 𝜓))
11	2	biimprcd 249	. . . . . 6 ⊢ (𝜓 → (𝑥 = 𝐴 → 𝜑))
12	10, 11	syl6 35	. . . . 5 ⊢ (∀𝑦 ∈ 𝐶 𝜓 → (𝑦 ∈ 𝐶 → (𝑥 = 𝐴 → 𝜑)))
13	8, 9, 12	rexlimd 3245	. . . 4 ⊢ (∀𝑦 ∈ 𝐶 𝜓 → (∃𝑦 ∈ 𝐶 𝑥 = 𝐴 → 𝜑))
14	7, 13	syl5 34	. . 3 ⊢ (∀𝑦 ∈ 𝐶 𝜓 → (𝑥 ∈ 𝐵 → 𝜑))
15	14	ralrimiv 3106	. 2 ⊢ (∀𝑦 ∈ 𝐶 𝜓 → ∀𝑥 ∈ 𝐵 𝜑)
16	6, 15	impbii 208	1 ⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐶 𝜓)

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1539   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-12 2173  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1542  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069

This theorem is referenced by: (None)