| 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 5365. (Contributed by NM, 14-Nov-2006.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| axprALT | ⊢ ∃𝑧∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zfpair 5359 | . . 3 ⊢ {𝑥, 𝑦} ∈ V | |
| 2 | 1 | isseti 3454 | . 2 ⊢ ∃𝑧 𝑧 = {𝑥, 𝑦} |
| 3 | dfcleq 2724 | . . 3 ⊢ (𝑧 = {𝑥, 𝑦} ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦})) | |
| 4 | vex 3440 | . . . . . . 7 ⊢ 𝑤 ∈ V | |
| 5 | 4 | elpr 4601 | . . . . . 6 ⊢ (𝑤 ∈ {𝑥, 𝑦} ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦)) |
| 6 | 5 | bibi2i 337 | . . . . 5 ⊢ ((𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) ↔ (𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))) |
| 7 | biimpr 220 | . . . . 5 ⊢ ((𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦)) → ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)) | |
| 8 | 6, 7 | sylbi 217 | . . . 4 ⊢ ((𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) → ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)) |
| 9 | 8 | alimi 1812 | . . 3 ⊢ (∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) → ∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)) |
| 10 | 3, 9 | sylbi 217 | . 2 ⊢ (𝑧 = {𝑥, 𝑦} → ∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)) |
| 11 | 2, 10 | eximii 1838 | 1 ⊢ ∃𝑧∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∨ wo 847 ∀wal 1539 = wceq 1541 ∃wex 1780 ∈ wcel 2111 {cpr 4578 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-v 3438 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4284 df-pw 4552 df-sn 4577 df-pr 4579 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |