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

Theorem rabeqbida 3443
Description: Version of rabeqbidva 3431 with two disjoint variable conditions removed and the third replaced by a nonfreeness hypothesis. (Contributed by BJ, 27-Apr-2019.)
Hypotheses
Ref Expression
rabeqbida.nf Ⅎ𝑥𝜑
rabeqbida.1 (𝜑 → 𝐴 = 𝐵)
rabeqbida.2 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒))
Assertion
Ref Expression
rabeqbida (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐵 ∣ 𝜒})

Proof of Theorem rabeqbida
StepHypRef Expression
1 rabeqbida.nf . . 3 Ⅎ𝑥𝜑
2 rabeqbida.2 . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒))
31, 2rabbida 3440 . 2 (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐴 ∣ 𝜒})
4 rabeqbida.1 . . 3 (𝜑 → 𝐴 = 𝐵)
51, 4rabeqd 3442 . 2 (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜒} = {𝑥 ∈ 𝐵 ∣ 𝜒})
63, 5eqtrd 2801 1 (𝜑 → {𝑥 ∈ 𝐴 ∣ 𝜓} = {𝑥 ∈ 𝐵 ∣ 𝜒})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572  Ⅎwnf 1818   ∈ wcel 2150  {crab 3415
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-12 2219  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1815  df-nf 1819  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-rab 3416
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator