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

Theorem ifboth 2371
Description: A wff th containing a conditional operator is true when both of its cases are true.
Hypotheses
Ref Expression
ifboth.1 |- (A = if(ph, A, B) -> (ps <-> th))
ifboth.2 |- (B = if(ph, A, B) -> (ch <-> th))
Assertion
Ref Expression
ifboth |- ((ps /\ ch) -> th)

Proof of Theorem ifboth
StepHypRef Expression
1 iftrue 2362 . . . . . 6 |- (ph -> if(ph, A, B) = A)
21eqcomd 1477 . . . . 5 |- (ph -> A = if(ph, A, B))
3 ifboth.1 . . . . 5 |- (A = if(ph, A, B) -> (ps <-> th))
42, 3syl 10 . . . 4 |- (ph -> (ps <-> th))
54biimpa 416 . . 3 |- ((ph /\ ps) -> th)
65adantrr 395 . 2 |- ((ph /\ (ps /\ ch)) -> th)
7 iffalse 2363 . . . . . 6 |- (-. ph -> if(ph, A, B) = B)
87eqcomd 1477 . . . . 5 |- (-. ph -> B = if(ph, A, B))
9 ifboth.2 . . . . . 6 |- (B = if(ph, A, B) -> (ch <-> th))
109bicomd 520 . . . . 5 |- (B = if(ph, A, B) -> (th <-> ch))
118, 10syl 10 . . . 4 |- (-. ph -> (th <-> ch))
1211biimpar 417 . . 3 |- ((-. ph /\ ch) -> th)
1312adantrl 394 . 2 |- ((-. ph /\ (ps /\ ch)) -> th)
146, 13pm2.61ian 476 1 |- ((ps /\ ch) -> th)
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   /\ wa 223   = wceq 954  ifcif 2357
This theorem is referenced by:  ifcl 2376  keephyp 2392  xrmaxltt 5869  xrltmint 5870  maxlet 5874  lemint 5877  maxltt 5878  blin 7804  opnin 7821  xplm 7925  xpcn 7926
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-12 966  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-clab 1462  df-cleq 1467  df-clel 1470  df-if 2358
Copyright terms: Public domain