| 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 5389. (Contributed by NM, 14-Nov-2006.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| axprALT | ⊢ ∃𝑧∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zfpair 5383 | . . 3 ⊢ {𝑥, 𝑦} ∈ V | |
| 2 | 1 | isseti 3475 | . 2 ⊢ ∃𝑧 𝑧 = {𝑥, 𝑦} |
| 3 | dfcleq 2758 | . . 3 ⊢ (𝑧 = {𝑥, 𝑦} ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦})) | |
| 4 | vex 3461 | . . . . . . 7 ⊢ 𝑤 ∈ V | |
| 5 | 4 | elpr 4610 | . . . . . 6 ⊢ (𝑤 ∈ {𝑥, 𝑦} ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦)) |
| 6 | 5 | bibi2i 340 | . . . . 5 ⊢ ((𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) ↔ (𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))) |
| 7 | biimpr 223 | . . . . 5 ⊢ ((𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦)) → ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)) | |
| 8 | 6, 7 | sylbi 220 | . . . 4 ⊢ ((𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) → ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)) |
| 9 | 8 | alimi 1834 | . . 3 ⊢ (∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) → ∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)) |
| 10 | 3, 9 | sylbi 220 | . 2 ⊢ (𝑧 = {𝑥, 𝑦} → ∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)) |
| 11 | 2, 10 | eximii 1860 | 1 ⊢ ∃𝑧∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∨ wo 860 ∀wal 1561 = wceq 1563 ∃wex 1802 ∈ wcel 2145 {cpr 4587 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-v 3459 df-dif 3910 df-un 3912 df-ss 3924 df-nul 4289 df-pw 4560 df-sn 4586 df-pr 4588 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |