| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prex | Structured version Visualization version GIF version | ||
| Description: The Axiom of Pairing using class variables. Theorem 7.13 of [Quine] p. 51. By virtue of its definition, an unordered pair remains a set (even though no longer a pair) even when its components are proper classes (see prprc 4726), so we can dispense with hypotheses requiring them to be sets. (Contributed by NM, 15-Jul-1993.) Avoid ax-nul 5253 and shorten proof. (Revised by GG, 6-Mar-2026.) |
| Ref | Expression |
|---|---|
| prex | ⊢ {𝐴, 𝐵} ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | axprg 5383 | . . . 4 ⊢ ∃𝑧∀𝑤((𝑤 = 𝐴 ∨ 𝑤 = 𝐵) → 𝑤 ∈ 𝑧) | |
| 2 | 1 | sepexi 5248 | . . 3 ⊢ ∃𝑧∀𝑤(𝑤 ∈ 𝑧 ↔ (𝑤 = 𝐴 ∨ 𝑤 = 𝐵)) |
| 3 | dfcleq 2730 | . . . . 5 ⊢ (𝑧 = {𝐴, 𝐵} ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝐴, 𝐵})) | |
| 4 | vex 3446 | . . . . . . . 8 ⊢ 𝑤 ∈ V | |
| 5 | 4 | elpr 4607 | . . . . . . 7 ⊢ (𝑤 ∈ {𝐴, 𝐵} ↔ (𝑤 = 𝐴 ∨ 𝑤 = 𝐵)) |
| 6 | 5 | bibi2i 337 | . . . . . 6 ⊢ ((𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝐴, 𝐵}) ↔ (𝑤 ∈ 𝑧 ↔ (𝑤 = 𝐴 ∨ 𝑤 = 𝐵))) |
| 7 | 6 | albii 1821 | . . . . 5 ⊢ (∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝐴, 𝐵}) ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ (𝑤 = 𝐴 ∨ 𝑤 = 𝐵))) |
| 8 | 3, 7 | bitri 275 | . . . 4 ⊢ (𝑧 = {𝐴, 𝐵} ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ (𝑤 = 𝐴 ∨ 𝑤 = 𝐵))) |
| 9 | 8 | exbii 1850 | . . 3 ⊢ (∃𝑧 𝑧 = {𝐴, 𝐵} ↔ ∃𝑧∀𝑤(𝑤 ∈ 𝑧 ↔ (𝑤 = 𝐴 ∨ 𝑤 = 𝐵))) |
| 10 | 2, 9 | mpbir 231 | . 2 ⊢ ∃𝑧 𝑧 = {𝐴, 𝐵} |
| 11 | 10 | issetri 3461 | 1 ⊢ {𝐴, 𝐵} ∈ V |
| Copyright terms: Public domain | W3C validator |