Theorem ralcom2 3377

Description: Commutation of restricted universal quantifiers. Note that 𝑥 and 𝑦 need not be disjoint (this makes the proof longer). This theorem relies on the full set of axioms up to ax-ext 2708 and it should no longer be used. Usage of ralcom 3289 is highly encouraged. (Contributed by NM, 24-Nov-1994.) (Proof shortened by Mario Carneiro, 17-Oct-2016.) (New usage is discouraged.)

Assertion

Ref	Expression
ralcom2	⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 → ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑)

Distinct variable groups:   𝑦,𝐴   𝑥,𝐴

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem ralcom2

Step	Hyp	Ref	Expression
1		eleq1w 2824	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
2	1	sps 2185	. . . . . 6 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
3	2	imbi1d 341	. . . . . . . . 9 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 → 𝜑) ↔ (𝑦 ∈ 𝐴 → 𝜑)))
4	3	dral1 2444	. . . . . . . 8 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜑)))
5	4	bicomd 223	. . . . . . 7 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦(𝑦 ∈ 𝐴 → 𝜑) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)))
6		df-ral 3062	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝐴 𝜑 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜑))
7		df-ral 3062	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
8	5, 6, 7	3bitr4g 314	. . . . . 6 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑦 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑))
9	2, 8	imbi12d 344	. . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 𝜑) ↔ (𝑦 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑)))
10	9	dral1 2444	. . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 𝜑) ↔ ∀𝑦(𝑦 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑)))
11		df-ral 3062	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 𝜑))
12		df-ral 3062	. . . 4 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑦(𝑦 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑))
13	10, 11, 12	3bitr4g 314	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 ↔ ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑))
14	13	biimpd 229	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 → ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑))
15		nfnae 2439	. . . . 5 ⊢ Ⅎ𝑦 ¬ ∀𝑥 𝑥 = 𝑦
16		nfra2 3376	. . . . 5 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑
17	15, 16	nfan 1899	. . . 4 ⊢ Ⅎ𝑦(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑)
18		nfnae 2439	. . . . . . . 8 ⊢ Ⅎ𝑥 ¬ ∀𝑥 𝑥 = 𝑦
19		nfra1 3284	. . . . . . . 8 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑
20	18, 19	nfan 1899	. . . . . . 7 ⊢ Ⅎ𝑥(¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑)
21		nfcvf 2932	. . . . . . . . 9 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝑦)
22	21	adantr 480	. . . . . . . 8 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑) → Ⅎ𝑥𝑦)
23		nfcvd 2906	. . . . . . . 8 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑) → Ⅎ𝑥𝐴)
24	22, 23	nfeld 2917	. . . . . . 7 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑) → Ⅎ𝑥 𝑦 ∈ 𝐴)
25	20, 24	nfan1 2200	. . . . . 6 ⊢ Ⅎ𝑥((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑) ∧ 𝑦 ∈ 𝐴)
26		rsp2 3277	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝜑))
27	26	ancomsd 465	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 → ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝜑))
28	27	expdimp 452	. . . . . . 7 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 ∧ 𝑦 ∈ 𝐴) → (𝑥 ∈ 𝐴 → 𝜑))
29	28	adantll 714	. . . . . 6 ⊢ (((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑) ∧ 𝑦 ∈ 𝐴) → (𝑥 ∈ 𝐴 → 𝜑))
30	25, 29	ralrimi 3257	. . . . 5 ⊢ (((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑) ∧ 𝑦 ∈ 𝐴) → ∀𝑥 ∈ 𝐴 𝜑)
31	30	ex 412	. . . 4 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑) → (𝑦 ∈ 𝐴 → ∀𝑥 ∈ 𝐴 𝜑))
32	17, 31	ralrimi 3257	. . 3 ⊢ ((¬ ∀𝑥 𝑥 = 𝑦 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑) → ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑)
33	32	ex 412	. 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 → ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑))
34	14, 33	pm2.61i 182	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝜑 → ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 𝜑)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1538   ∈ wcel 2108  Ⅎwnfc 2890  ∀wral 3061

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-13 2377  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1543  df-ex 1780  df-nf 1784  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ral 3062

This theorem is referenced by: (None)