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

Theorem reusv2lem1 5190
Description: Lemma for reusv2 5195. (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 4230 . . 3 (𝐴 ≠ ∅ ↔ ∃𝑦 𝑦𝐴)
2 nfra1 3186 . . . . 5 𝑦𝑦𝐴 𝑥 = 𝐵
32nfmov 2600 . . . 4 𝑦∃*𝑥𝑦𝐴 𝑥 = 𝐵
4 rsp 3172 . . . . . . 7 (∀𝑦𝐴 𝑥 = 𝐵 → (𝑦𝐴𝑥 = 𝐵))
54com12 32 . . . . . 6 (𝑦𝐴 → (∀𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵))
65alrimiv 1905 . . . . 5 (𝑦𝐴 → ∀𝑥(∀𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵))
7 mo2icl 3641 . . . . 5 (∀𝑥(∀𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵) → ∃*𝑥𝑦𝐴 𝑥 = 𝐵)
86, 7syl 17 . . . 4 (𝑦𝐴 → ∃*𝑥𝑦𝐴 𝑥 = 𝐵)
93, 8exlimi 2182 . . 3 (∃𝑦 𝑦𝐴 → ∃*𝑥𝑦𝐴 𝑥 = 𝐵)
101, 9sylbi 218 . 2 (𝐴 ≠ ∅ → ∃*𝑥𝑦𝐴 𝑥 = 𝐵)
11 df-eu 2612 . . 3 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ (∃𝑥𝑦𝐴 𝑥 = 𝐵 ∧ ∃*𝑥𝑦𝐴 𝑥 = 𝐵))
1211rbaib 539 . 2 (∃*𝑥𝑦𝐴 𝑥 = 𝐵 → (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃𝑥𝑦𝐴 𝑥 = 𝐵))
1310, 12syl 17 1 (𝐴 ≠ ∅ → (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃𝑥𝑦𝐴 𝑥 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wal 1520   = wceq 1522  wex 1761  wcel 2081  ∃*wmo 2574  ∃!weu 2611  wne 2984  wral 3105  c0 4211
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791  ax-5 1888  ax-6 1947  ax-7 1992  ax-8 2083  ax-9 2091  ax-10 2112  ax-11 2126  ax-12 2141  ax-ext 2769
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-tru 1525  df-ex 1762  df-nf 1766  df-sb 2043  df-mo 2576  df-eu 2612  df-clab 2776  df-cleq 2788  df-clel 2863  df-nfc 2935  df-ne 2985  df-ral 3110  df-v 3439  df-dif 3862  df-nul 4212
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator