Mathbox for BJ < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-cdeqab Structured version   Visualization version   GIF version

Theorem bj-cdeqab 31975
 Description: Remove dependency on ax-13 2234 from cdeqab 3392. (Contributed by BJ, 6-Oct-2019.) (Proof modification is discouraged.)
Hypothesis
Ref Expression
bj-cdeqab.1 CondEq(𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
bj-cdeqab CondEq(𝑥 = 𝑦 → {𝑧𝜑} = {𝑧𝜓})
Distinct variable groups:   𝑥,𝑧   𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝜓(𝑥,𝑦,𝑧)

Proof of Theorem bj-cdeqab
StepHypRef Expression
1 bj-cdeqab.1 . . . 4 CondEq(𝑥 = 𝑦 → (𝜑𝜓))
21cdeqri 3388 . . 3 (𝑥 = 𝑦 → (𝜑𝜓))
32bj-abbidv 31967 . 2 (𝑥 = 𝑦 → {𝑧𝜑} = {𝑧𝜓})
43cdeqi 3387 1 CondEq(𝑥 = 𝑦 → {𝑧𝜑} = {𝑧𝜓})
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 195   = wceq 1475  {cab 2596  CondEqwcdeq 3385 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-cdeq 3386 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator