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

Theorem reupick 4285
 Description: Restricted uniqueness "picks" a member of a subclass. (Contributed by NM, 21-Aug-1999.)
Assertion
Ref Expression
reupick (((𝐴𝐵 ∧ (∃𝑥𝐴 𝜑 ∧ ∃!𝑥𝐵 𝜑)) ∧ 𝜑) → (𝑥𝐴𝑥𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem reupick
StepHypRef Expression
1 ssel 3959 . . 3 (𝐴𝐵 → (𝑥𝐴𝑥𝐵))
21ad2antrr 724 . 2 (((𝐴𝐵 ∧ (∃𝑥𝐴 𝜑 ∧ ∃!𝑥𝐵 𝜑)) ∧ 𝜑) → (𝑥𝐴𝑥𝐵))
3 df-rex 3142 . . . . . 6 (∃𝑥𝐴 𝜑 ↔ ∃𝑥(𝑥𝐴𝜑))
4 df-reu 3143 . . . . . 6 (∃!𝑥𝐵 𝜑 ↔ ∃!𝑥(𝑥𝐵𝜑))
53, 4anbi12i 628 . . . . 5 ((∃𝑥𝐴 𝜑 ∧ ∃!𝑥𝐵 𝜑) ↔ (∃𝑥(𝑥𝐴𝜑) ∧ ∃!𝑥(𝑥𝐵𝜑)))
61ancrd 554 . . . . . . . . . . 11 (𝐴𝐵 → (𝑥𝐴 → (𝑥𝐵𝑥𝐴)))
76anim1d 612 . . . . . . . . . 10 (𝐴𝐵 → ((𝑥𝐴𝜑) → ((𝑥𝐵𝑥𝐴) ∧ 𝜑)))
8 an32 644 . . . . . . . . . 10 (((𝑥𝐵𝑥𝐴) ∧ 𝜑) ↔ ((𝑥𝐵𝜑) ∧ 𝑥𝐴))
97, 8syl6ib 253 . . . . . . . . 9 (𝐴𝐵 → ((𝑥𝐴𝜑) → ((𝑥𝐵𝜑) ∧ 𝑥𝐴)))
109eximdv 1912 . . . . . . . 8 (𝐴𝐵 → (∃𝑥(𝑥𝐴𝜑) → ∃𝑥((𝑥𝐵𝜑) ∧ 𝑥𝐴)))
11 eupick 2712 . . . . . . . . 9 ((∃!𝑥(𝑥𝐵𝜑) ∧ ∃𝑥((𝑥𝐵𝜑) ∧ 𝑥𝐴)) → ((𝑥𝐵𝜑) → 𝑥𝐴))
1211ex 415 . . . . . . . 8 (∃!𝑥(𝑥𝐵𝜑) → (∃𝑥((𝑥𝐵𝜑) ∧ 𝑥𝐴) → ((𝑥𝐵𝜑) → 𝑥𝐴)))
1310, 12syl9 77 . . . . . . 7 (𝐴𝐵 → (∃!𝑥(𝑥𝐵𝜑) → (∃𝑥(𝑥𝐴𝜑) → ((𝑥𝐵𝜑) → 𝑥𝐴))))
1413com23 86 . . . . . 6 (𝐴𝐵 → (∃𝑥(𝑥𝐴𝜑) → (∃!𝑥(𝑥𝐵𝜑) → ((𝑥𝐵𝜑) → 𝑥𝐴))))
1514imp32 421 . . . . 5 ((𝐴𝐵 ∧ (∃𝑥(𝑥𝐴𝜑) ∧ ∃!𝑥(𝑥𝐵𝜑))) → ((𝑥𝐵𝜑) → 𝑥𝐴))
165, 15sylan2b 595 . . . 4 ((𝐴𝐵 ∧ (∃𝑥𝐴 𝜑 ∧ ∃!𝑥𝐵 𝜑)) → ((𝑥𝐵𝜑) → 𝑥𝐴))
1716expcomd 419 . . 3 ((𝐴𝐵 ∧ (∃𝑥𝐴 𝜑 ∧ ∃!𝑥𝐵 𝜑)) → (𝜑 → (𝑥𝐵𝑥𝐴)))
1817imp 409 . 2 (((𝐴𝐵 ∧ (∃𝑥𝐴 𝜑 ∧ ∃!𝑥𝐵 𝜑)) ∧ 𝜑) → (𝑥𝐵𝑥𝐴))
192, 18impbid 214 1 (((𝐴𝐵 ∧ (∃𝑥𝐴 𝜑 ∧ ∃!𝑥𝐵 𝜑)) ∧ 𝜑) → (𝑥𝐴𝑥𝐵))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398  ∃wex 1774   ∈ wcel 2108  ∃!weu 2647  ∃wrex 3137  ∃!wreu 3138   ⊆ wss 3934 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-rex 3142  df-reu 3143  df-in 3941  df-ss 3950 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator