Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ifbieq12d2 Unicode version

Theorem ifbieq12d2 23955
Description: Equivalence deduction for conditional operators. (Contributed by Thierry Arnoux, 14-Feb-2017.)
Hypotheses
Ref Expression
ifbieq12d2.1  |-  ( ph  ->  ( ps  <->  ch )
)
ifbieq12d2.2  |-  ( (
ph  /\  ps )  ->  A  =  C )
ifbieq12d2.3  |-  ( (
ph  /\  -.  ps )  ->  B  =  D )
Assertion
Ref Expression
ifbieq12d2  |-  ( ph  ->  if ( ps ,  A ,  B )  =  if ( ch ,  C ,  D )
)

Proof of Theorem ifbieq12d2
StepHypRef Expression
1 exmid 405 . . . 4  |-  ( ps  \/  -.  ps )
2 ifbieq12d2.1 . . . . . . . . . 10  |-  ( ph  ->  ( ps  <->  ch )
)
3 iftrue 3705 . . . . . . . . . 10  |-  ( ch 
->  if ( ch ,  C ,  D )  =  C )
42, 3syl6bi 220 . . . . . . . . 9  |-  ( ph  ->  ( ps  ->  if ( ch ,  C ,  D )  =  C ) )
54imp 419 . . . . . . . 8  |-  ( (
ph  /\  ps )  ->  if ( ch ,  C ,  D )  =  C )
6 ifbieq12d2.2 . . . . . . . 8  |-  ( (
ph  /\  ps )  ->  A  =  C )
75, 6eqtr4d 2439 . . . . . . 7  |-  ( (
ph  /\  ps )  ->  if ( ch ,  C ,  D )  =  A )
87ex 424 . . . . . 6  |-  ( ph  ->  ( ps  ->  if ( ch ,  C ,  D )  =  A ) )
98ancld 537 . . . . 5  |-  ( ph  ->  ( ps  ->  ( ps  /\  if ( ch ,  C ,  D
)  =  A ) ) )
102notbid 286 . . . . . . . . . 10  |-  ( ph  ->  ( -.  ps  <->  -.  ch )
)
11 iffalse 3706 . . . . . . . . . 10  |-  ( -. 
ch  ->  if ( ch ,  C ,  D
)  =  D )
1210, 11syl6bi 220 . . . . . . . . 9  |-  ( ph  ->  ( -.  ps  ->  if ( ch ,  C ,  D )  =  D ) )
1312imp 419 . . . . . . . 8  |-  ( (
ph  /\  -.  ps )  ->  if ( ch ,  C ,  D )  =  D )
14 ifbieq12d2.3 . . . . . . . 8  |-  ( (
ph  /\  -.  ps )  ->  B  =  D )
1513, 14eqtr4d 2439 . . . . . . 7  |-  ( (
ph  /\  -.  ps )  ->  if ( ch ,  C ,  D )  =  B )
1615ex 424 . . . . . 6  |-  ( ph  ->  ( -.  ps  ->  if ( ch ,  C ,  D )  =  B ) )
1716ancld 537 . . . . 5  |-  ( ph  ->  ( -.  ps  ->  ( -.  ps  /\  if ( ch ,  C ,  D )  =  B ) ) )
189, 17orim12d 812 . . . 4  |-  ( ph  ->  ( ( ps  \/  -.  ps )  ->  (
( ps  /\  if ( ch ,  C ,  D )  =  A )  \/  ( -. 
ps  /\  if ( ch ,  C ,  D )  =  B ) ) ) )
191, 18mpi 17 . . 3  |-  ( ph  ->  ( ( ps  /\  if ( ch ,  C ,  D )  =  A )  \/  ( -. 
ps  /\  if ( ch ,  C ,  D )  =  B ) ) )
20 eqif 3732 . . 3  |-  ( if ( ch ,  C ,  D )  =  if ( ps ,  A ,  B )  <->  ( ( ps  /\  if ( ch ,  C ,  D
)  =  A )  \/  ( -.  ps  /\  if ( ch ,  C ,  D )  =  B ) ) )
2119, 20sylibr 204 . 2  |-  ( ph  ->  if ( ch ,  C ,  D )  =  if ( ps ,  A ,  B )
)
2221eqcomd 2409 1  |-  ( ph  ->  if ( ps ,  A ,  B )  =  if ( ch ,  C ,  D )
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 177    \/ wo 358    /\ wa 359    = wceq 1649   ifcif 3699
This theorem is referenced by:  itgeq12dv  24594
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2391  df-cleq 2397  df-clel 2400  df-if 3700
  Copyright terms: Public domain W3C validator