Theorem moelOLD 3358

Description: Obsolete version of moel 3357 as of 23-Nov-2024. (Contributed by Thierry Arnoux, 26-Jul-2018.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
moelOLD	⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 = 𝑦)

Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem moelOLD

Step	Hyp	Ref	Expression
1		ralcom4 3164	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 ∈ 𝐴 → 𝑥 = 𝑦) ↔ ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐴 → 𝑥 = 𝑦))
2		df-ral 3071	. . 3 ⊢ (∀𝑦 ∈ 𝐴 𝑥 = 𝑦 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝑥 = 𝑦))
3	2	ralbii 3093	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 = 𝑦 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 ∈ 𝐴 → 𝑥 = 𝑦))
4		alcom 2160	. . 3 ⊢ (∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑥 = 𝑦) ↔ ∀𝑦∀𝑥((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑥 = 𝑦))
5		eleq1w 2823	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
6	5	mo4 2568	. . 3 ⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑥 = 𝑦))
7		df-ral 3071	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐴 → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐴 → 𝑥 = 𝑦)))
8		impexp 451	. . . . . 6 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐴 → 𝑥 = 𝑦)))
9	8	albii 1826	. . . . 5 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐴 → 𝑥 = 𝑦)))
10	7, 9	bitr4i 277	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐴 → 𝑥 = 𝑦) ↔ ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑥 = 𝑦))
11	10	albii 1826	. . 3 ⊢ (∀𝑦∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐴 → 𝑥 = 𝑦) ↔ ∀𝑦∀𝑥((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑥 = 𝑦))
12	4, 6, 11	3bitr4i 303	. 2 ⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 ∈ 𝐴 → 𝑥 = 𝑦))
13	1, 3, 12	3bitr4ri 304	1 ⊢ (∃*𝑥 𝑥 ∈ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 = 𝑦)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396  ∀wal 1540   ∈ wcel 2110  ∃*wmo 2540  ∀wral 3066

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2015  ax-8 2112  ax-11 2158

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1787  df-mo 2542  df-clel 2818  df-ral 3071

This theorem is referenced by: (None)