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

Theorem reurab 3664
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 225 . . . . . . 7 (𝑥 = 𝑦 → (𝜓𝜑))
32equcoms 2040 . . . . . 6 (𝑦 = 𝑥 → (𝜓𝜑))
43elrab 3650 . . . . 5 (𝑥 ∈ {𝑦𝐴𝜓} ↔ (𝑥𝐴𝜑))
54anbi1i 633 . . . 4 ((𝑥 ∈ {𝑦𝐴𝜓} ∧ 𝜒) ↔ ((𝑥𝐴𝜑) ∧ 𝜒))
6 anass 472 . . . 4 (((𝑥𝐴𝜑) ∧ 𝜒) ↔ (𝑥𝐴 ∧ (𝜑𝜒)))
75, 6bitri 277 . . 3 ((𝑥 ∈ {𝑦𝐴𝜓} ∧ 𝜒) ↔ (𝑥𝐴 ∧ (𝜑𝜒)))
87eubii 2612 . 2 (∃!𝑥(𝑥 ∈ {𝑦𝐴𝜓} ∧ 𝜒) ↔ ∃!𝑥(𝑥𝐴 ∧ (𝜑𝜒)))
9 df-reu 3368 . 2 (∃!𝑥 ∈ {𝑦𝐴𝜓}𝜒 ↔ ∃!𝑥(𝑥 ∈ {𝑦𝐴𝜓} ∧ 𝜒))
10 df-reu 3368 . 2 (∃!𝑥𝐴 (𝜑𝜒) ↔ ∃!𝑥(𝑥𝐴 ∧ (𝜑𝜒)))
118, 9, 103bitr4i 305 1 (∃!𝑥 ∈ {𝑦𝐴𝜓}𝜒 ↔ ∃!𝑥𝐴 (𝜑𝜒))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  wcel 2142  ∃!weu 2595  ∃!wreu 3365  {crab 3414
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734
This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1563  df-ex 1800  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-reu 3368  df-rab 3415  df-v 3456
This theorem is referenced by:  eqcuts  27875
  Copyright terms: Public domain W3C validator