| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > zfpair2 | GIF version | ||
| Description: Derive the abbreviated version of the Axiom of Pairing from ax-pr 4321. (Contributed by NM, 14-Nov-2006.) |
| Ref | Expression |
|---|---|
| zfpair2 | ⊢ {𝑥, 𝑦} ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-pr 4321 | . . . 4 ⊢ ∃𝑧∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧) | |
| 2 | 1 | bm1.3ii 4230 | . . 3 ⊢ ∃𝑧∀𝑤(𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦)) |
| 3 | dfcleq 2226 | . . . . 5 ⊢ (𝑧 = {𝑥, 𝑦} ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦})) | |
| 4 | vex 2815 | . . . . . . . 8 ⊢ 𝑤 ∈ V | |
| 5 | 4 | elpr 3709 | . . . . . . 7 ⊢ (𝑤 ∈ {𝑥, 𝑦} ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦)) |
| 6 | 5 | bibi2i 227 | . . . . . 6 ⊢ ((𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) ↔ (𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))) |
| 7 | 6 | albii 1519 | . . . . 5 ⊢ (∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))) |
| 8 | 3, 7 | bitri 184 | . . . 4 ⊢ (𝑧 = {𝑥, 𝑦} ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))) |
| 9 | 8 | exbii 1654 | . . 3 ⊢ (∃𝑧 𝑧 = {𝑥, 𝑦} ↔ ∃𝑧∀𝑤(𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))) |
| 10 | 2, 9 | mpbir 146 | . 2 ⊢ ∃𝑧 𝑧 = {𝑥, 𝑦} |
| 11 | 10 | issetri 2822 | 1 ⊢ {𝑥, 𝑦} ∈ V |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 ∨ wo 716 ∀wal 1396 = wceq 1398 ∃wex 1541 ∈ wcel 2203 Vcvv 2812 {cpr 3689 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2206 ax-ext 2214 ax-sep 4227 ax-pr 4321 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-v 2814 df-un 3214 df-sn 3694 df-pr 3695 |
| This theorem is referenced by: vsnex 4323 prexg 4324 onintexmid 4694 funopg 5385 funopsn 5859 umgredg 16132 |
| Copyright terms: Public domain | W3C validator |