Theorem axprg 5395

Description: Derive The Axiom of Pairing with class variables. (Contributed by GG, 6-Mar-2026.)

Assertion

Ref	Expression
axprg	⊢ ∃𝑧∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧)

Distinct variable groups:   𝑧,𝐴,𝑤   𝑧,𝐵,𝑤

Proof of Theorem axprg

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2765	. . . . 5 ⊢ (𝑤 = 𝑥 → (𝑤 = 𝐴 ↔ 𝑥 = 𝐴))
2		eqeq1 2765	. . . . 5 ⊢ (𝑤 = 𝑥 → (𝑤 = 𝐵 ↔ 𝑥 = 𝐵))
3	1, 2	orbi12d 932	. . . 4 ⊢ (𝑤 = 𝑥 → ((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)))
4	3	cbvexvw 2070	. . 3 ⊢ (∃𝑤(𝑤 = 𝐴 ∨ 𝑤 = 𝐵) ↔ ∃𝑥(𝑥 = 𝐴 ∨ 𝑥 = 𝐵))
5		axprglem 5394	. . . . 5 ⊢ (𝑥 = 𝐴 → ∃𝑧∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
6		axprglem 5394	. . . . . 6 ⊢ (𝑥 = 𝐵 → ∃𝑧∀𝑤((𝑤 = 𝐵 ∨ 𝑤 = 𝐴) → 𝑤 ∈ 𝑧))
7		pm1.4 883	. . . . . . . . 9 ⊢ ((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → (𝑤 = 𝐵 ∨ 𝑤 = 𝐴))
8	7	imim1i 64	. . . . . . . 8 ⊢ (((𝑤 = 𝐵 ∨ 𝑤 = 𝐴) → 𝑤 ∈ 𝑧) → ((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
9	8	alimi 1844	. . . . . . 7 ⊢ (∀𝑤((𝑤 = 𝐵 ∨ 𝑤 = 𝐴) → 𝑤 ∈ 𝑧) → ∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
10	9	eximi 1868	. . . . . 6 ⊢ (∃𝑧∀𝑤((𝑤 = 𝐵 ∨ 𝑤 = 𝐴) → 𝑤 ∈ 𝑧) → ∃𝑧∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
11	6, 10	syl 18	. . . . 5 ⊢ (𝑥 = 𝐵 → ∃𝑧∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
12	5, 11	jaoi 871	. . . 4 ⊢ ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → ∃𝑧∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
13	12	exlimiv 1963	. . 3 ⊢ (∃𝑥(𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → ∃𝑧∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
14	4, 13	sylbi 220	. 2 ⊢ (∃𝑤(𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → ∃𝑧∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
15		alnex 1814	. . . . 5 ⊢ (∀𝑤 ¬ (𝑤 = 𝐴 ∨ 𝑤 = 𝐵) ↔ ¬ ∃𝑤(𝑤 = 𝐴 ∨ 𝑤 = 𝐵))
16		pm2.21 124	. . . . . 6 ⊢ (¬ (𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → ((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
17	16	alimi 1844	. . . . 5 ⊢ (∀𝑤 ¬ (𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → ∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
18	15, 17	sylbir 238	. . . 4 ⊢ (¬ ∃𝑤(𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → ∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
19	18	exgen 2007	. . 3 ⊢ ∃𝑧(¬ ∃𝑤(𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → ∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
20	19	19.37iv 1981	. 2 ⊢ (¬ ∃𝑤(𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → ∃𝑧∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧))
21	14, 20	pm2.61i 184	1 ⊢ ∃𝑧∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∨ wo 861  ∀wal 1568   = wceq 1570  ∃wex 1812

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836

This theorem is used by:  prex  5396