Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > axprALT | Structured version Visualization version GIF version |
Description: Alternate proof of axpr 5351. (Contributed by NM, 14-Nov-2006.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
axprALT | ⊢ ∃𝑧∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zfpair 5344 | . . 3 ⊢ {𝑥, 𝑦} ∈ V | |
2 | 1 | isseti 3447 | . 2 ⊢ ∃𝑧 𝑧 = {𝑥, 𝑦} |
3 | dfcleq 2731 | . . 3 ⊢ (𝑧 = {𝑥, 𝑦} ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦})) | |
4 | vex 3436 | . . . . . . 7 ⊢ 𝑤 ∈ V | |
5 | 4 | elpr 4584 | . . . . . 6 ⊢ (𝑤 ∈ {𝑥, 𝑦} ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦)) |
6 | 5 | bibi2i 338 | . . . . 5 ⊢ ((𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) ↔ (𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))) |
7 | biimpr 219 | . . . . 5 ⊢ ((𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦)) → ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)) | |
8 | 6, 7 | sylbi 216 | . . . 4 ⊢ ((𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) → ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)) |
9 | 8 | alimi 1814 | . . 3 ⊢ (∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) → ∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)) |
10 | 3, 9 | sylbi 216 | . 2 ⊢ (𝑧 = {𝑥, 𝑦} → ∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)) |
11 | 2, 10 | eximii 1839 | 1 ⊢ ∃𝑧∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∨ wo 844 ∀wal 1537 = wceq 1539 ∃wex 1782 ∈ wcel 2106 {cpr 4563 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-pw 4535 df-sn 4562 df-pr 4564 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |