| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zfpair2 | Structured version Visualization version GIF version | ||
| Description: Derive the abbreviated version of the Axiom of Pairing from ax-pr 5409. See zfpair 5397 for its derivation from the other axioms. (Contributed by NM, 14-Nov-2006.) |
| Ref | Expression |
|---|---|
| zfpair2 | ⊢ {𝑥, 𝑦} ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-pr 5409 | . . . 4 ⊢ ∃𝑧∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧) | |
| 2 | 1 | sepexi 5269 | . . 3 ⊢ ∃𝑧∀𝑤(𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦)) |
| 3 | dfcleq 2759 | . . . . 5 ⊢ (𝑧 = {𝑥, 𝑦} ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦})) | |
| 4 | vex 3462 | . . . . . . . 8 ⊢ 𝑤 ∈ V | |
| 5 | 4 | elpr 4619 | . . . . . . 7 ⊢ (𝑤 ∈ {𝑥, 𝑦} ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦)) |
| 6 | 5 | bibi2i 340 | . . . . . 6 ⊢ ((𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) ↔ (𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))) |
| 7 | 6 | albii 1852 | . . . . 5 ⊢ (∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))) |
| 8 | 3, 7 | bitri 278 | . . . 4 ⊢ (𝑧 = {𝑥, 𝑦} ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))) |
| 9 | 8 | exbii 1881 | . . 3 ⊢ (∃𝑧 𝑧 = {𝑥, 𝑦} ↔ ∃𝑧∀𝑤(𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))) |
| 10 | 2, 9 | mpbir 234 | . 2 ⊢ ∃𝑧 𝑧 = {𝑥, 𝑦} |
| 11 | 10 | issetri 3477 | 1 ⊢ {𝑥, 𝑦} ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∨ wo 861 ∀wal 1568 = wceq 1570 ∃wex 1812 ∈ wcel 2146 Vcvv 3458 {cpr 4596 |
| 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 2148 ax-9 2156 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| 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 2745 df-cleq 2758 df-clel 2841 df-v 3460 df-un 3913 df-sn 4595 df-pr 4597 |
| This theorem is used by: vsnex 5411 prexOLD 5419 pwssun 5558 xpsspw 5801 funopg 6577 fiint 9296 brdom7disj 10533 brdom6disj 10534 2pthfrgrrn 30670 sprval 48269 prprval 48304 reupr 48312 |
| Copyright terms: Public domain | W3C validator |