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

Theorem reurab 3666
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 2053 . . . . . 6 (𝑦 = 𝑥 → (𝜓𝜑))
43elrab 3652 . . . . 5 (𝑥 ∈ {𝑦𝐴𝜓} ↔ (𝑥𝐴𝜑))
54anbi1i 636 . . . 4 ((𝑥 ∈ {𝑦𝐴𝜓} ∧ 𝜒) ↔ ((𝑥𝐴𝜑) ∧ 𝜒))
6 anass 474 . . . 4 (((𝑥𝐴𝜑) ∧ 𝜒) ↔ (𝑥𝐴 ∧ (𝜑𝜒)))
75, 6bitri 278 . . 3 ((𝑥 ∈ {𝑦𝐴𝜓} ∧ 𝜒) ↔ (𝑥𝐴 ∧ (𝜑𝜒)))
87eubii 2615 . 2 (∃!𝑥(𝑥 ∈ {𝑦𝐴𝜓} ∧ 𝜒) ↔ ∃!𝑥(𝑥𝐴 ∧ (𝜑𝜒)))
9 df-reu 3372 . 2 (∃!𝑥 ∈ {𝑦𝐴𝜓}𝜒 ↔ ∃!𝑥(𝑥 ∈ {𝑦𝐴𝜓} ∧ 𝜒))
10 df-reu 3372 . 2 (∃!𝑥𝐴 (𝜑𝜒) ↔ ∃!𝑥(𝑥𝐴 ∧ (𝜑𝜒)))
118, 9, 103bitr4i 306 1 (∃!𝑥 ∈ {𝑦𝐴𝜓}𝜒 ↔ ∃!𝑥𝐴 (𝜑𝜒))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  wcel 2146  ∃!weu 2598  ∃!wreu 3369  {crab 3418
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-reu 3372  df-rab 3419  df-v 3459
This theorem is used by:  eqcuts  28029
  Copyright terms: Public domain W3C validator