HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem ifeq1d 2373
Description: Equality deduction for conditional operator.
Hypothesis
Ref Expression
ifeq1d.1 |- (ph -> A = B)
Assertion
Ref Expression
ifeq1d |- (ph -> if(ps, A, C) = if(ps, B, C))

Proof of Theorem ifeq1d
StepHypRef Expression
1 ifeq1d.1 . 2 |- (ph -> A = B)
2 ifeq1 2368 . 2 |- (A = B -> if(ps, A, C) = if(ps, B, C))
31, 2syl 10 1 |- (ph -> if(ps, A, C) = if(ps, B, C))
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 958  ifcif 2365
This theorem is referenced by:  oev 4159  bcvalt 6958  ruclem4 7514  lmfexlem2 7954  spwval2 8649
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-clab 1467  df-cleq 1472  df-clel 1475  df-if 2366
Copyright terms: Public domain