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

Theorem rexeqbii 3337
Description: Equality deduction for restricted existential quantifier, changing both formula and quantifier domain. Inference form. (Contributed by David Moews, 1-May-2017.)
Hypotheses
Ref Expression
rexeqbii.1 𝐴 = 𝐵
rexeqbii.2 (𝜓 ↔ 𝜒)
Assertion
Ref Expression
rexeqbii (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜒)

Proof of Theorem rexeqbii
StepHypRef Expression
1 rexeqbii.1 . . . 4 𝐴 = 𝐵
21eleq2i 2856 . . 3 (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)
3 rexeqbii.2 . . 3 (𝜓 ↔ 𝜒)
42, 3anbi12i 640 . 2 ((𝑥 ∈ 𝐴 ∧ 𝜓) ↔ (𝑥 ∈ 𝐵 ∧ 𝜒))
54rexbii2 3109 1 (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐵 𝜒)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∈ wcel 2147  ∃wrex 3090
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2755  df-clel 2839  df-rex 3091
This theorem is used by:  1arithidom  34173  bnj882  35667  satfbrsuc  36339  iuneq12i  37199  setc1onsubc  51132
  Copyright terms: Public domain W3C validator