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

Theorem reurab 3673
Description: Restricted existential uniqueness of a restricted abstraction. (Contributed by Scott Fenton, 8-Aug-2024.)
Hypothesis
Ref Expression
reurab.1 (𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
reurab (∃!𝑥 ∈ {𝑦𝐴𝜓}𝜒 ↔ ∃!𝑥𝐴 (𝜑𝜒))
Distinct variable groups:   𝑦,𝐴   𝜑,𝑦   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥,𝑦)   𝜒(𝑥,𝑦)   𝐴(𝑥)

Proof of Theorem reurab
StepHypRef Expression
1 reurab.1 . . . . . . . 8 (𝑥 = 𝑦 → (𝜑𝜓))
21bicomd 226 . . . . . . 7 (𝑥 = 𝑦 → (𝜓𝜑))
32equcoms 2047 . . . . . 6 (𝑦 = 𝑥 → (𝜓𝜑))
43elrab 3659 . . . . 5 (𝑥 ∈ {𝑦𝐴𝜓} ↔ (𝑥𝐴𝜑))
54anbi1i 635 . . . 4 ((𝑥 ∈ {𝑦𝐴𝜓} ∧ 𝜒) ↔ ((𝑥𝐴𝜑) ∧ 𝜒))
6 anass 473 . . . 4 (((𝑥𝐴𝜑) ∧ 𝜒) ↔ (𝑥𝐴 ∧ (𝜑𝜒)))
75, 6bitri 278 . . 3 ((𝑥 ∈ {𝑦𝐴𝜓} ∧ 𝜒) ↔ (𝑥𝐴 ∧ (𝜑𝜒)))
87eubii 2619 . 2 (∃!𝑥(𝑥 ∈ {𝑦𝐴𝜓} ∧ 𝜒) ↔ ∃!𝑥(𝑥𝐴 ∧ (𝜑𝜒)))
9 df-reu 3377 . 2 (∃!𝑥 ∈ {𝑦𝐴𝜓}𝜒 ↔ ∃!𝑥(𝑥 ∈ {𝑦𝐴𝜓} ∧ 𝜒))
10 df-reu 3377 . 2 (∃!𝑥𝐴 (𝜑𝜒) ↔ ∃!𝑥(𝑥𝐴 ∧ (𝜑𝜒)))
118, 9, 103bitr4i 306 1 (∃!𝑥 ∈ {𝑦𝐴𝜓}𝜒 ↔ ∃!𝑥𝐴 (𝜑𝜒))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wcel 2149  ∃!weu 2602  ∃!wreu 3374  {crab 3423
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1570  df-ex 1807  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-reu 3377  df-rab 3424  df-v 3465
This theorem is referenced by:  eqcuts  27943
  Copyright terms: Public domain W3C validator