Theorem wl-dfcleq 38628

Description: The defining characterization of class equality. This version of df-cleq 2755 has no restrictions, unlike the forms on which it is based. It is proved in Tarski's FOL from the axiom of extensionality (ax-ext 2735), the definition of class equality (df-cleq 2755), and the definition of class membership (df-clel 2839).

Its forward implication is known as "class extensionality". (Contributed by NM, 15-Sep-1993.) (Revised by BJ, 24-Jun-2019.) Base on wl-dfcleq.just 38624. (Revised by Wolf Lammen, 7-Apr-2026.)

Assertion

Ref	Expression
wl-dfcleq	⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem wl-dfcleq

Dummy variables 𝑦 𝐶 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1w 2847	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
2		eleq1w 2847	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
3	1, 2	bibi12d 348	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ (𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵)))
4	3	cbvalvw 2071	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵) ↔ ∀𝑦(𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵))
5		eqid 2763	. 2 ⊢ 𝐴 = 𝐴
6		eqtr 2783	. . . 4 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = 𝐶) → 𝐴 = 𝐶)
7	6	eqcomd 2769	. . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = 𝐶) → 𝐶 = 𝐴)
8	7	ex 418	. 2 ⊢ (𝐴 = 𝐵 → (𝐵 = 𝐶 → 𝐶 = 𝐴))
9		eqeq2 2775	. . . . . 6 ⊢ (𝐴 = 𝐵 → (𝑥 = 𝐴 ↔ 𝑥 = 𝐵))
10	9	biimpd 232	. . . . 5 ⊢ (𝐴 = 𝐵 → (𝑥 = 𝐴 → 𝑥 = 𝐵))
11	10	anim1d 623	. . . 4 ⊢ (𝐴 = 𝐵 → ((𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐶) → (𝑥 = 𝐵 ∧ 𝑥 ∈ 𝐶)))
12	11	eximdv 1952	. . 3 ⊢ (𝐴 = 𝐵 → (∃𝑥(𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐶) → ∃𝑥(𝑥 = 𝐵 ∧ 𝑥 ∈ 𝐶)))
13		dfclel 2840	. . 3 ⊢ (𝐴 ∈ 𝐶 ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐶))
14		dfclel 2840	. . 3 ⊢ (𝐵 ∈ 𝐶 ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝑥 ∈ 𝐶))
15	12, 13, 14	3imtr4g 299	. 2 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐶 → 𝐵 ∈ 𝐶))
16		wl-dfcleq.basic 38623	. . . . . 6 ⊢ (𝐴 = 𝐵 ↔ ∀𝑦(𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵))
17		biimp 218	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵) → (𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵))
18	17	alimi 1844	. . . . . . 7 ⊢ (∀𝑦(𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵) → ∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵))
19	1	biimpd 232	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 → 𝑦 ∈ 𝐴))
20	19	eqcoms 2771	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (𝑥 ∈ 𝐴 → 𝑦 ∈ 𝐴))
21		eleq1w 2847	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
22	21	biimpd 232	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝐵 → 𝑥 ∈ 𝐵))
23	20, 22	imim12d 82	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → ((𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)))
24	23	spimvw 2021	. . . . . . 7 ⊢ (∀𝑦(𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
25	18, 24	syl 18	. . . . . 6 ⊢ (∀𝑦(𝑦 ∈ 𝐴 ↔ 𝑦 ∈ 𝐵) → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
26	16, 25	sylbi 220	. . . . 5 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
27	26	anim2d 624	. . . 4 ⊢ (𝐴 = 𝐵 → ((𝑥 = 𝐶 ∧ 𝑥 ∈ 𝐴) → (𝑥 = 𝐶 ∧ 𝑥 ∈ 𝐵)))
28	27	eximdv 1952	. . 3 ⊢ (𝐴 = 𝐵 → (∃𝑥(𝑥 = 𝐶 ∧ 𝑥 ∈ 𝐴) → ∃𝑥(𝑥 = 𝐶 ∧ 𝑥 ∈ 𝐵)))
29		dfclel 2840	. . 3 ⊢ (𝐶 ∈ 𝐴 ↔ ∃𝑥(𝑥 = 𝐶 ∧ 𝑥 ∈ 𝐴))
30		dfclel 2840	. . 3 ⊢ (𝐶 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐶 ∧ 𝑥 ∈ 𝐵))
31	28, 29, 30	3imtr4g 299	. 2 ⊢ (𝐴 = 𝐵 → (𝐶 ∈ 𝐴 → 𝐶 ∈ 𝐵))
32	4, 5, 8, 15, 31	wl-dfcleq.just 38624	1 ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2755  df-clel 2839

This theorem is used by: (None)