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

Theorem reusv2lem1 5334
Description: Lemma for reusv2 5339. (Contributed by NM, 22-Oct-2010.) (Proof shortened by Mario Carneiro, 19-Nov-2016.)
Assertion
Ref Expression
reusv2lem1 (𝐴 ≠ ∅ → (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃𝑥𝑦𝐴 𝑥 = 𝐵))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐵(𝑦)

Proof of Theorem reusv2lem1
StepHypRef Expression
1 n0 4300 . . 3 (𝐴 ≠ ∅ ↔ ∃𝑦 𝑦𝐴)
2 nfra1 3256 . . . . 5 𝑦𝑦𝐴 𝑥 = 𝐵
32nfmov 2555 . . . 4 𝑦∃*𝑥𝑦𝐴 𝑥 = 𝐵
4 rsp 3220 . . . . . . 7 (∀𝑦𝐴 𝑥 = 𝐵 → (𝑦𝐴𝑥 = 𝐵))
54com12 32 . . . . . 6 (𝑦𝐴 → (∀𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵))
65alrimiv 1928 . . . . 5 (𝑦𝐴 → ∀𝑥(∀𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵))
7 mo2icl 3668 . . . . 5 (∀𝑥(∀𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵) → ∃*𝑥𝑦𝐴 𝑥 = 𝐵)
86, 7syl 17 . . . 4 (𝑦𝐴 → ∃*𝑥𝑦𝐴 𝑥 = 𝐵)
93, 8exlimi 2220 . . 3 (∃𝑦 𝑦𝐴 → ∃*𝑥𝑦𝐴 𝑥 = 𝐵)
101, 9sylbi 217 . 2 (𝐴 ≠ ∅ → ∃*𝑥𝑦𝐴 𝑥 = 𝐵)
11 df-eu 2564 . . 3 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ (∃𝑥𝑦𝐴 𝑥 = 𝐵 ∧ ∃*𝑥𝑦𝐴 𝑥 = 𝐵))
1211rbaib 538 . 2 (∃*𝑥𝑦𝐴 𝑥 = 𝐵 → (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃𝑥𝑦𝐴 𝑥 = 𝐵))
1310, 12syl 17 1 (𝐴 ≠ ∅ → (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃𝑥𝑦𝐴 𝑥 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wal 1539   = wceq 1541  wex 1780  wcel 2111  ∃*wmo 2533  ∃!weu 2563  wne 2928  wral 3047  c0 4280
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
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-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-v 3438  df-dif 3900  df-nul 4281
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator