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

Theorem xadd4d 10237
Description: Rearrangement of 4 terms in a sum for extended addition, analogous to add4d 8458. (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 10221 . . . 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 1274 . . 3  |-  ( ph  ->  ( ( C +e B ) +e D )  =  ( C +e
( B +e
D ) ) )
65oveq2d 6074 . 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 10236 . . . 4  |-  ( ph  ->  ( C +e
D )  e.  RR* )
11 xaddnemnf 10209 . . . . 5  |-  ( ( ( C  e.  RR*  /\  C  =/= -oo )  /\  ( D  e.  RR*  /\  D  =/= -oo )
)  ->  ( C +e D )  =/= -oo )
121, 3, 11syl2anc 411 . . . 4  |-  ( ph  ->  ( C +e
D )  =/= -oo )
13 xaddass 10221 . . . 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 1278 . . 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 10213 . . . . . . 7  |-  ( ( C  e.  RR*  /\  B  e.  RR* )  ->  ( C +e B )  =  ( B +e C ) )
178, 15, 16syl2anc 411 . . . . . 6  |-  ( ph  ->  ( C +e
B )  =  ( B +e C ) )
1817oveq1d 6073 . . . . 5  |-  ( ph  ->  ( ( C +e B ) +e D )  =  ( ( B +e C ) +e D ) )
19 xaddass 10221 . . . . . 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 1274 . . . . 5  |-  ( ph  ->  ( ( B +e C ) +e D )  =  ( B +e
( C +e
D ) ) )
2118, 20eqtr2d 2268 . . . 4  |-  ( ph  ->  ( B +e
( C +e
D ) )  =  ( ( C +e B ) +e D ) )
2221oveq2d 6074 . . 3  |-  ( ph  ->  ( A +e
( B +e
( C +e
D ) ) )  =  ( A +e ( ( C +e B ) +e D ) ) )
2314, 22eqtrd 2267 . 2  |-  ( ph  ->  ( ( A +e B ) +e ( C +e D ) )  =  ( A +e ( ( C +e B ) +e D ) ) )
2415, 9xaddcld 10236 . . 3  |-  ( ph  ->  ( B +e
D )  e.  RR* )
25 xaddnemnf 10209 . . . 4  |-  ( ( ( B  e.  RR*  /\  B  =/= -oo )  /\  ( D  e.  RR*  /\  D  =/= -oo )
)  ->  ( B +e D )  =/= -oo )
262, 3, 25syl2anc 411 . . 3  |-  ( ph  ->  ( B +e
D )  =/= -oo )
27 xaddass 10221 . . 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 1278 . 2  |-  ( ph  ->  ( ( A +e C ) +e ( B +e D ) )  =  ( A +e ( C +e ( B +e D ) ) ) )
296, 23, 283eqtr4d 2277 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 1398    e. wcel 2205    =/= wne 2414  (class class class)co 6058   -oocmnf 8322   RR*cxr 8323   +ecxad 10122
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240  ax-addcom 8243  ax-addass 8245  ax-rnegex 8252
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-pnf 8326  df-mnf 8327  df-xr 8328  df-xadd 10125
This theorem is referenced by:  xnn0add4d  10238
  Copyright terms: Public domain W3C validator