ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xadd4d Unicode version

Theorem xadd4d 9821
Description: Rearrangement of 4 terms in a sum for extended addition, analogous to add4d 8067. (Contributed by Alexander van der Vekens, 21-Dec-2017.)
Hypotheses
Ref Expression
xadd4d.1  |-  ( ph  ->  ( A  e.  RR*  /\  A  =/= -oo )
)
xadd4d.2  |-  ( ph  ->  ( B  e.  RR*  /\  B  =/= -oo )
)
xadd4d.3  |-  ( ph  ->  ( C  e.  RR*  /\  C  =/= -oo )
)
xadd4d.4  |-  ( ph  ->  ( D  e.  RR*  /\  D  =/= -oo )
)
Assertion
Ref Expression
xadd4d  |-  ( ph  ->  ( ( A +e B ) +e ( C +e D ) )  =  ( ( A +e C ) +e ( B +e D ) ) )

Proof of Theorem xadd4d
StepHypRef Expression
1 xadd4d.3 . . . 4  |-  ( ph  ->  ( C  e.  RR*  /\  C  =/= -oo )
)
2 xadd4d.2 . . . 4  |-  ( ph  ->  ( B  e.  RR*  /\  B  =/= -oo )
)
3 xadd4d.4 . . . 4  |-  ( ph  ->  ( D  e.  RR*  /\  D  =/= -oo )
)
4 xaddass 9805 . . . 4  |-  ( ( ( C  e.  RR*  /\  C  =/= -oo )  /\  ( B  e.  RR*  /\  B  =/= -oo )  /\  ( D  e.  RR*  /\  D  =/= -oo )
)  ->  ( ( C +e B ) +e D )  =  ( C +e ( B +e D ) ) )
51, 2, 3, 4syl3anc 1228 . . 3  |-  ( ph  ->  ( ( C +e B ) +e D )  =  ( C +e
( B +e
D ) ) )
65oveq2d 5858 . 2  |-  ( ph  ->  ( A +e
( ( C +e B ) +e D ) )  =  ( A +e ( C +e ( B +e D ) ) ) )
7 xadd4d.1 . . . 4  |-  ( ph  ->  ( A  e.  RR*  /\  A  =/= -oo )
)
81simpld 111 . . . . 5  |-  ( ph  ->  C  e.  RR* )
93simpld 111 . . . . 5  |-  ( ph  ->  D  e.  RR* )
108, 9xaddcld 9820 . . . 4  |-  ( ph  ->  ( C +e
D )  e.  RR* )
11 xaddnemnf 9793 . . . . 5  |-  ( ( ( C  e.  RR*  /\  C  =/= -oo )  /\  ( D  e.  RR*  /\  D  =/= -oo )
)  ->  ( C +e D )  =/= -oo )
121, 3, 11syl2anc 409 . . . 4  |-  ( ph  ->  ( C +e
D )  =/= -oo )
13 xaddass 9805 . . . 4  |-  ( ( ( A  e.  RR*  /\  A  =/= -oo )  /\  ( B  e.  RR*  /\  B  =/= -oo )  /\  ( ( C +e D )  e. 
RR*  /\  ( C +e D )  =/= -oo ) )  ->  ( ( A +e B ) +e ( C +e D ) )  =  ( A +e ( B +e ( C +e D ) ) ) )
147, 2, 10, 12, 13syl112anc 1232 . . 3  |-  ( ph  ->  ( ( A +e B ) +e ( C +e D ) )  =  ( A +e ( B +e ( C +e D ) ) ) )
152simpld 111 . . . . . . 7  |-  ( ph  ->  B  e.  RR* )
16 xaddcom 9797 . . . . . . 7  |-  ( ( C  e.  RR*  /\  B  e.  RR* )  ->  ( C +e B )  =  ( B +e C ) )
178, 15, 16syl2anc 409 . . . . . 6  |-  ( ph  ->  ( C +e
B )  =  ( B +e C ) )
1817oveq1d 5857 . . . . 5  |-  ( ph  ->  ( ( C +e B ) +e D )  =  ( ( B +e C ) +e D ) )
19 xaddass 9805 . . . . . 6  |-  ( ( ( B  e.  RR*  /\  B  =/= -oo )  /\  ( C  e.  RR*  /\  C  =/= -oo )  /\  ( D  e.  RR*  /\  D  =/= -oo )
)  ->  ( ( B +e C ) +e D )  =  ( B +e ( C +e D ) ) )
202, 1, 3, 19syl3anc 1228 . . . . 5  |-  ( ph  ->  ( ( B +e C ) +e D )  =  ( B +e
( C +e
D ) ) )
2118, 20eqtr2d 2199 . . . 4  |-  ( ph  ->  ( B +e
( C +e
D ) )  =  ( ( C +e B ) +e D ) )
2221oveq2d 5858 . . 3  |-  ( ph  ->  ( A +e
( B +e
( C +e
D ) ) )  =  ( A +e ( ( C +e B ) +e D ) ) )
2314, 22eqtrd 2198 . 2  |-  ( ph  ->  ( ( A +e B ) +e ( C +e D ) )  =  ( A +e ( ( C +e B ) +e D ) ) )
2415, 9xaddcld 9820 . . 3  |-  ( ph  ->  ( B +e
D )  e.  RR* )
25 xaddnemnf 9793 . . . 4  |-  ( ( ( B  e.  RR*  /\  B  =/= -oo )  /\  ( D  e.  RR*  /\  D  =/= -oo )
)  ->  ( B +e D )  =/= -oo )
262, 3, 25syl2anc 409 . . 3  |-  ( ph  ->  ( B +e
D )  =/= -oo )
27 xaddass 9805 . . 3  |-  ( ( ( A  e.  RR*  /\  A  =/= -oo )  /\  ( C  e.  RR*  /\  C  =/= -oo )  /\  ( ( B +e D )  e. 
RR*  /\  ( B +e D )  =/= -oo ) )  ->  ( ( A +e C ) +e ( B +e D ) )  =  ( A +e ( C +e ( B +e D ) ) ) )
287, 1, 24, 26, 27syl112anc 1232 . 2  |-  ( ph  ->  ( ( A +e C ) +e ( B +e D ) )  =  ( A +e ( C +e ( B +e D ) ) ) )
296, 23, 283eqtr4d 2208 1  |-  ( ph  ->  ( ( A +e B ) +e ( C +e D ) )  =  ( ( A +e C ) +e ( B +e D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1343    e. wcel 2136    =/= wne 2336  (class class class)co 5842   -oocmnf 7931   RR*cxr 7932   +ecxad 9706
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-cnex 7844  ax-resscn 7845  ax-1re 7847  ax-addrcl 7850  ax-addcom 7853  ax-addass 7855  ax-rnegex 7862
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-if 3521  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-pnf 7935  df-mnf 7936  df-xr 7937  df-xadd 9709
This theorem is referenced by:  xnn0add4d  9822
  Copyright terms: Public domain W3C validator