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

Theorem cdeqeq 3397
 Description: Distribute conditional equality over equality. (Contributed by Mario Carneiro, 11-Aug-2016.)
Hypotheses
Ref Expression
cdeqeq.1 CondEq(𝑥 = 𝑦𝐴 = 𝐵)
cdeqeq.2 CondEq(𝑥 = 𝑦𝐶 = 𝐷)
Assertion
Ref Expression
cdeqeq CondEq(𝑥 = 𝑦 → (𝐴 = 𝐶𝐵 = 𝐷))

Proof of Theorem cdeqeq
StepHypRef Expression
1 cdeqeq.1 . . . 4 CondEq(𝑥 = 𝑦𝐴 = 𝐵)
21cdeqri 3388 . . 3 (𝑥 = 𝑦𝐴 = 𝐵)
3 cdeqeq.2 . . . 4 CondEq(𝑥 = 𝑦𝐶 = 𝐷)
43cdeqri 3388 . . 3 (𝑥 = 𝑦𝐶 = 𝐷)
52, 4eqeq12d 2625 . 2 (𝑥 = 𝑦 → (𝐴 = 𝐶𝐵 = 𝐷))
65cdeqi 3387 1 CondEq(𝑥 = 𝑦 → (𝐴 = 𝐶𝐵 = 𝐷))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 195   = wceq 1475  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-ext 2590 This theorem depends on definitions:  df-bi 196  df-an 385  df-cleq 2603  df-cdeq 3386 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator