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

Theorem reusv2lem3 5397
Description: Lemma for reusv2 5400. (Contributed by NM, 14-Dec-2012.) (Proof shortened by Mario Carneiro, 19-Nov-2016.)
Assertion
Ref Expression
reusv2lem3 (∀𝑦𝐴 𝐵 ∈ V → (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃!𝑥𝑦𝐴 𝑥 = 𝐵))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐵(𝑦)

Proof of Theorem reusv2lem3
StepHypRef Expression
1 simpr 483 . . . 4 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → ∃!𝑥𝑦𝐴 𝑥 = 𝐵)
2 nfv 1915 . . . . . 6 𝑥𝑦𝐴 𝐵 ∈ V
3 nfeu1 2580 . . . . . 6 𝑥∃!𝑥𝑦𝐴 𝑥 = 𝐵
42, 3nfan 1900 . . . . 5 𝑥(∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵)
5 euex 2569 . . . . . . . 8 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → ∃𝑥𝑦𝐴 𝑥 = 𝐵)
6 rexn0 4509 . . . . . . . . 9 (∃𝑦𝐴 𝑥 = 𝐵𝐴 ≠ ∅)
76exlimiv 1931 . . . . . . . 8 (∃𝑥𝑦𝐴 𝑥 = 𝐵𝐴 ≠ ∅)
8 r19.2z 4493 . . . . . . . . 9 ((𝐴 ≠ ∅ ∧ ∀𝑦𝐴 𝑥 = 𝐵) → ∃𝑦𝐴 𝑥 = 𝐵)
98ex 411 . . . . . . . 8 (𝐴 ≠ ∅ → (∀𝑦𝐴 𝑥 = 𝐵 → ∃𝑦𝐴 𝑥 = 𝐵))
105, 7, 93syl 18 . . . . . . 7 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → (∀𝑦𝐴 𝑥 = 𝐵 → ∃𝑦𝐴 𝑥 = 𝐵))
1110adantl 480 . . . . . 6 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → (∀𝑦𝐴 𝑥 = 𝐵 → ∃𝑦𝐴 𝑥 = 𝐵))
12 nfra1 3279 . . . . . . . 8 𝑦𝑦𝐴 𝐵 ∈ V
13 nfre1 3280 . . . . . . . . 9 𝑦𝑦𝐴 𝑥 = 𝐵
1413nfeuw 2585 . . . . . . . 8 𝑦∃!𝑥𝑦𝐴 𝑥 = 𝐵
1512, 14nfan 1900 . . . . . . 7 𝑦(∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵)
16 rsp 3242 . . . . . . . . . . . . . 14 (∀𝑦𝐴 𝐵 ∈ V → (𝑦𝐴𝐵 ∈ V))
1716impcom 406 . . . . . . . . . . . . 13 ((𝑦𝐴 ∧ ∀𝑦𝐴 𝐵 ∈ V) → 𝐵 ∈ V)
18 isset 3485 . . . . . . . . . . . . 13 (𝐵 ∈ V ↔ ∃𝑥 𝑥 = 𝐵)
1917, 18sylib 217 . . . . . . . . . . . 12 ((𝑦𝐴 ∧ ∀𝑦𝐴 𝐵 ∈ V) → ∃𝑥 𝑥 = 𝐵)
2019adantrr 713 . . . . . . . . . . 11 ((𝑦𝐴 ∧ (∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵)) → ∃𝑥 𝑥 = 𝐵)
21 rspe 3244 . . . . . . . . . . . . . . 15 ((𝑦𝐴𝑥 = 𝐵) → ∃𝑦𝐴 𝑥 = 𝐵)
2221ex 411 . . . . . . . . . . . . . 14 (𝑦𝐴 → (𝑥 = 𝐵 → ∃𝑦𝐴 𝑥 = 𝐵))
2322ancrd 550 . . . . . . . . . . . . 13 (𝑦𝐴 → (𝑥 = 𝐵 → (∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵)))
2423eximdv 1918 . . . . . . . . . . . 12 (𝑦𝐴 → (∃𝑥 𝑥 = 𝐵 → ∃𝑥(∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵)))
2524imp 405 . . . . . . . . . . 11 ((𝑦𝐴 ∧ ∃𝑥 𝑥 = 𝐵) → ∃𝑥(∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵))
2620, 25syldan 589 . . . . . . . . . 10 ((𝑦𝐴 ∧ (∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵)) → ∃𝑥(∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵))
27 eupick 2627 . . . . . . . . . 10 ((∃!𝑥𝑦𝐴 𝑥 = 𝐵 ∧ ∃𝑥(∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵)) → (∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵))
281, 26, 27syl2an2 682 . . . . . . . . 9 ((𝑦𝐴 ∧ (∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵)) → (∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵))
2928ex 411 . . . . . . . 8 (𝑦𝐴 → ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → (∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵)))
3029com3l 89 . . . . . . 7 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → (∃𝑦𝐴 𝑥 = 𝐵 → (𝑦𝐴𝑥 = 𝐵)))
3115, 13, 30ralrimd 3259 . . . . . 6 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → (∃𝑦𝐴 𝑥 = 𝐵 → ∀𝑦𝐴 𝑥 = 𝐵))
3211, 31impbid 211 . . . . 5 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → (∀𝑦𝐴 𝑥 = 𝐵 ↔ ∃𝑦𝐴 𝑥 = 𝐵))
334, 32eubid 2579 . . . 4 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃!𝑥𝑦𝐴 𝑥 = 𝐵))
341, 33mpbird 256 . . 3 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → ∃!𝑥𝑦𝐴 𝑥 = 𝐵)
3534ex 411 . 2 (∀𝑦𝐴 𝐵 ∈ V → (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → ∃!𝑥𝑦𝐴 𝑥 = 𝐵))
36 reusv2lem2 5396 . 2 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → ∃!𝑥𝑦𝐴 𝑥 = 𝐵)
3735, 36impbid1 224 1 (∀𝑦𝐴 𝐵 ∈ V → (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃!𝑥𝑦𝐴 𝑥 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394   = wceq 1539  wex 1779  wcel 2104  ∃!weu 2560  wne 2938  wral 3059  wrex 3068  Vcvv 3472  c0 4321
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-nul 5305  ax-pow 5362
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-ne 2939  df-ral 3060  df-rex 3069  df-v 3474  df-dif 3950  df-nul 4322
This theorem is referenced by:  reusv2lem4  5398  eusv4  5403
  Copyright terms: Public domain W3C validator