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

Theorem reusv2lem3 5291
Description: Lemma for reusv2 5294. (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 485 . . . 4 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → ∃!𝑥𝑦𝐴 𝑥 = 𝐵)
2 nfv 1906 . . . . . 6 𝑥𝑦𝐴 𝐵 ∈ V
3 nfeu1 2667 . . . . . 6 𝑥∃!𝑥𝑦𝐴 𝑥 = 𝐵
42, 3nfan 1891 . . . . 5 𝑥(∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵)
5 euex 2655 . . . . . . . 8 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → ∃𝑥𝑦𝐴 𝑥 = 𝐵)
6 rexn0 4450 . . . . . . . . 9 (∃𝑦𝐴 𝑥 = 𝐵𝐴 ≠ ∅)
76exlimiv 1922 . . . . . . . 8 (∃𝑥𝑦𝐴 𝑥 = 𝐵𝐴 ≠ ∅)
8 r19.2z 4436 . . . . . . . . 9 ((𝐴 ≠ ∅ ∧ ∀𝑦𝐴 𝑥 = 𝐵) → ∃𝑦𝐴 𝑥 = 𝐵)
98ex 413 . . . . . . . 8 (𝐴 ≠ ∅ → (∀𝑦𝐴 𝑥 = 𝐵 → ∃𝑦𝐴 𝑥 = 𝐵))
105, 7, 93syl 18 . . . . . . 7 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → (∀𝑦𝐴 𝑥 = 𝐵 → ∃𝑦𝐴 𝑥 = 𝐵))
1110adantl 482 . . . . . 6 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → (∀𝑦𝐴 𝑥 = 𝐵 → ∃𝑦𝐴 𝑥 = 𝐵))
12 nfra1 3216 . . . . . . . 8 𝑦𝑦𝐴 𝐵 ∈ V
13 nfre1 3303 . . . . . . . . 9 𝑦𝑦𝐴 𝑥 = 𝐵
1413nfeuw 2672 . . . . . . . 8 𝑦∃!𝑥𝑦𝐴 𝑥 = 𝐵
1512, 14nfan 1891 . . . . . . 7 𝑦(∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵)
16 rsp 3202 . . . . . . . . . . . . . 14 (∀𝑦𝐴 𝐵 ∈ V → (𝑦𝐴𝐵 ∈ V))
1716impcom 408 . . . . . . . . . . . . 13 ((𝑦𝐴 ∧ ∀𝑦𝐴 𝐵 ∈ V) → 𝐵 ∈ V)
18 isset 3504 . . . . . . . . . . . . 13 (𝐵 ∈ V ↔ ∃𝑥 𝑥 = 𝐵)
1917, 18sylib 219 . . . . . . . . . . . 12 ((𝑦𝐴 ∧ ∀𝑦𝐴 𝐵 ∈ V) → ∃𝑥 𝑥 = 𝐵)
2019adantrr 713 . . . . . . . . . . 11 ((𝑦𝐴 ∧ (∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵)) → ∃𝑥 𝑥 = 𝐵)
21 rspe 3301 . . . . . . . . . . . . . . 15 ((𝑦𝐴𝑥 = 𝐵) → ∃𝑦𝐴 𝑥 = 𝐵)
2221ex 413 . . . . . . . . . . . . . 14 (𝑦𝐴 → (𝑥 = 𝐵 → ∃𝑦𝐴 𝑥 = 𝐵))
2322ancrd 552 . . . . . . . . . . . . 13 (𝑦𝐴 → (𝑥 = 𝐵 → (∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵)))
2423eximdv 1909 . . . . . . . . . . . 12 (𝑦𝐴 → (∃𝑥 𝑥 = 𝐵 → ∃𝑥(∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵)))
2524imp 407 . . . . . . . . . . 11 ((𝑦𝐴 ∧ ∃𝑥 𝑥 = 𝐵) → ∃𝑥(∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵))
2620, 25syldan 591 . . . . . . . . . 10 ((𝑦𝐴 ∧ (∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵)) → ∃𝑥(∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵))
27 eupick 2711 . . . . . . . . . 10 ((∃!𝑥𝑦𝐴 𝑥 = 𝐵 ∧ ∃𝑥(∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵)) → (∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵))
281, 26, 27syl2an2 682 . . . . . . . . 9 ((𝑦𝐴 ∧ (∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵)) → (∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵))
2928ex 413 . . . . . . . 8 (𝑦𝐴 → ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → (∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝐵)))
3029com3l 89 . . . . . . 7 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → (∃𝑦𝐴 𝑥 = 𝐵 → (𝑦𝐴𝑥 = 𝐵)))
3115, 13, 30ralrimd 3215 . . . . . 6 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → (∃𝑦𝐴 𝑥 = 𝐵 → ∀𝑦𝐴 𝑥 = 𝐵))
3211, 31impbid 213 . . . . 5 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → (∀𝑦𝐴 𝑥 = 𝐵 ↔ ∃𝑦𝐴 𝑥 = 𝐵))
334, 32eubid 2666 . . . 4 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃!𝑥𝑦𝐴 𝑥 = 𝐵))
341, 33mpbird 258 . . 3 ((∀𝑦𝐴 𝐵 ∈ V ∧ ∃!𝑥𝑦𝐴 𝑥 = 𝐵) → ∃!𝑥𝑦𝐴 𝑥 = 𝐵)
3534ex 413 . 2 (∀𝑦𝐴 𝐵 ∈ V → (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → ∃!𝑥𝑦𝐴 𝑥 = 𝐵))
36 reusv2lem2 5290 . 2 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → ∃!𝑥𝑦𝐴 𝑥 = 𝐵)
3735, 36impbid1 226 1 (∀𝑦𝐴 𝐵 ∈ V → (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃!𝑥𝑦𝐴 𝑥 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1528  wex 1771  wcel 2105  ∃!weu 2646  wne 3013  wral 3135  wrex 3136  Vcvv 3492  c0 4288
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-nul 5201  ax-pow 5257
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-ral 3140  df-rex 3141  df-v 3494  df-dif 3936  df-nul 4289
This theorem is referenced by:  reusv2lem4  5292  eusv4  5297
  Copyright terms: Public domain W3C validator