MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  axprALT Structured version   Visualization version   GIF version

Theorem axprALT 5384
Description: Alternate proof of axpr 5389. (Contributed by NM, 14-Nov-2006.) (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
axprALT ∃𝑧∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)
Distinct variable groups:   𝑥,𝑧,𝑤   𝑦,𝑧,𝑤

Proof of Theorem axprALT
StepHypRef Expression
1 zfpair 5383 . . 3 {𝑥, 𝑦} ∈ V
21isseti 3469 . 2 ∃𝑧 𝑧 = {𝑥, 𝑦}
3 dfcleq 2754 . . 3 (𝑧 = {𝑥, 𝑦} ↔ ∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}))
4 vex 3455 . . . . . . 7 𝑤 ∈ V
54elpr 4609 . . . . . 6 (𝑤 ∈ {𝑥, 𝑦} ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦))
65bibi2i 340 . . . . 5 ((𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) ↔ (𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦)))
7 biimpr 223 . . . . 5 ((𝑤 ∈ 𝑧 ↔ (𝑤 = 𝑥 ∨ 𝑤 = 𝑦)) → ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧))
86, 7sylbi 220 . . . 4 ((𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) → ((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧))
98alimi 1844 . . 3 (∀𝑤(𝑤 ∈ 𝑧 ↔ 𝑤 ∈ {𝑥, 𝑦}) → ∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧))
103, 9sylbi 220 . 2 (𝑧 = {𝑥, 𝑦} → ∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧))
112, 10eximii 1870 1 ∃𝑧∀𝑤((𝑤 = 𝑥 ∨ 𝑤 = 𝑦) → 𝑤 ∈ 𝑧)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∨ wo 861  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cpr 4586
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-pw 4559  df-sn 4585  df-pr 4587
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator