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

Theorem xadd4d 10269
Description: Rearrangement of 4 terms in a sum for extended addition, analogous to add4d 8488. (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 10253 . . . 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 1278 . . 3  |-  ( ph  ->  ( ( C +e B ) +e D )  =  ( C +e
( B +e
D ) ) )
65oveq2d 6094 . 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 112 . . . . 5  |-  ( ph  ->  C  e.  RR* )
93simpld 112 . . . . 5  |-  ( ph  ->  D  e.  RR* )
108, 9xaddcld 10268 . . . 4  |-  ( ph  ->  ( C +e
D )  e.  RR* )
11 xaddnemnf 10241 . . . . 5  |-  ( ( ( C  e.  RR*  /\  C  =/= -oo )  /\  ( D  e.  RR*  /\  D  =/= -oo )
)  ->  ( C +e D )  =/= -oo )
121, 3, 11syl2anc 415 . . . 4  |-  ( ph  ->  ( C +e
D )  =/= -oo )
13 xaddass 10253 . . . 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 1282 . . 3  |-  ( ph  ->  ( ( A +e B ) +e ( C +e D ) )  =  ( A +e ( B +e ( C +e D ) ) ) )
152simpld 112 . . . . . . 7  |-  ( ph  ->  B  e.  RR* )
16 xaddcom 10245 . . . . . . 7  |-  ( ( C  e.  RR*  /\  B  e.  RR* )  ->  ( C +e B )  =  ( B +e C ) )
178, 15, 16syl2anc 415 . . . . . 6  |-  ( ph  ->  ( C +e
B )  =  ( B +e C ) )
1817oveq1d 6093 . . . . 5  |-  ( ph  ->  ( ( C +e B ) +e D )  =  ( ( B +e C ) +e D ) )
19 xaddass 10253 . . . . . 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 1278 . . . . 5  |-  ( ph  ->  ( ( B +e C ) +e D )  =  ( B +e
( C +e
D ) ) )
2118, 20eqtr2d 2272 . . . 4  |-  ( ph  ->  ( B +e
( C +e
D ) )  =  ( ( C +e B ) +e D ) )
2221oveq2d 6094 . . 3  |-  ( ph  ->  ( A +e
( B +e
( C +e
D ) ) )  =  ( A +e ( ( C +e B ) +e D ) ) )
2314, 22eqtrd 2271 . 2  |-  ( ph  ->  ( ( A +e B ) +e ( C +e D ) )  =  ( A +e ( ( C +e B ) +e D ) ) )
2415, 9xaddcld 10268 . . 3  |-  ( ph  ->  ( B +e
D )  e.  RR* )
25 xaddnemnf 10241 . . . 4  |-  ( ( ( B  e.  RR*  /\  B  =/= -oo )  /\  ( D  e.  RR*  /\  D  =/= -oo )
)  ->  ( B +e D )  =/= -oo )
262, 3, 25syl2anc 415 . . 3  |-  ( ph  ->  ( B +e
D )  =/= -oo )
27 xaddass 10253 . . 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 1282 . 2  |-  ( ph  ->  ( ( A +e C ) +e ( B +e D ) )  =  ( A +e ( C +e ( B +e D ) ) ) )
296, 23, 283eqtr4d 2281 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 104    = wceq 1402    e. wcel 2209    =/= wne 2420  (class class class)co 6078   -oocmnf 8351   RR*cxr 8352   +ecxad 10154
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-cnex 8263  ax-resscn 8264  ax-1re 8266  ax-addrcl 8269  ax-addcom 8272  ax-addass 8274  ax-rnegex 8281
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-fv 5383  df-ov 6081  df-oprab 6082  df-mpo 6083  df-1st 6367  df-2nd 6368  df-pnf 8355  df-mnf 8356  df-xr 8357  df-xadd 10157
This theorem is referenced by:  xnn0add4d  10270
  Copyright terms: Public domain W3C validator