Theorem xaddpnf1 9803

Description: Addition of positive infinity on the right. (Contributed by Mario Carneiro, 20-Aug-2015.)

Assertion

Ref	Expression
xaddpnf1	|- ( ( A e. RR* /\ A =/= -oo ) -> ( A +e +oo ) = +oo )

Proof of Theorem xaddpnf1

Step	Hyp	Ref	Expression
1		pnfxr 7972	. . . 4 |- +oo e. RR*
2		xaddval 9802	. . . 4 |- ( ( A e. RR* /\ +oo e. RR* ) -> ( A +e +oo ) = if ( A = +oo , if ( +oo = -oo , 0 , +oo ) , if ( A = -oo , if ( +oo = +oo , 0 , -oo ) , if ( +oo = +oo , +oo , if ( +oo = -oo , -oo , ( A + +oo ) ) ) ) ) )
3	1, 2	mpan2 423	. . 3 |- ( A e. RR* -> ( A +e +oo ) = if ( A = +oo , if ( +oo = -oo , 0 , +oo ) , if ( A = -oo , if ( +oo = +oo , 0 , -oo ) , if ( +oo = +oo , +oo , if ( +oo = -oo , -oo , ( A + +oo ) ) ) ) ) )
4	3	adantr 274	. 2 |- ( ( A e. RR* /\ A =/= -oo ) -> ( A +e +oo ) = if ( A = +oo , if ( +oo = -oo , 0 , +oo ) , if ( A = -oo , if ( +oo = +oo , 0 , -oo ) , if ( +oo = +oo , +oo , if ( +oo = -oo , -oo , ( A + +oo ) ) ) ) ) )
5		pnfnemnf 7974	. . . . 5 |- +oo =/= -oo
6		ifnefalse 3537	. . . . 5 |- ( +oo =/= -oo -> if ( +oo = -oo , 0 , +oo ) = +oo )
7	5, 6	mp1i 10	. . . 4 |- ( A =/= -oo -> if ( +oo = -oo , 0 , +oo ) = +oo )
8		ifnefalse 3537	. . . . 5 |- ( A =/= -oo -> if ( A = -oo , if ( +oo = +oo , 0 , -oo ) , if ( +oo = +oo , +oo , if ( +oo = -oo , -oo , ( A + +oo ) ) ) ) = if ( +oo = +oo , +oo , if ( +oo = -oo , -oo , ( A + +oo ) ) ) )
9		eqid 2170	. . . . . 6 |- +oo = +oo
10	9	iftruei 3532	. . . . 5 |- if ( +oo = +oo , +oo , if ( +oo = -oo , -oo , ( A + +oo ) ) ) = +oo
11	8, 10	eqtrdi 2219	. . . 4 |- ( A =/= -oo -> if ( A = -oo , if ( +oo = +oo , 0 , -oo ) , if ( +oo = +oo , +oo , if ( +oo = -oo , -oo , ( A + +oo ) ) ) ) = +oo )
12	7, 11	ifeq12d 3545	. . 3 |- ( A =/= -oo -> if ( A = +oo , if ( +oo = -oo , 0 , +oo ) , if ( A = -oo , if ( +oo = +oo , 0 , -oo ) , if ( +oo = +oo , +oo , if ( +oo = -oo , -oo , ( A + +oo ) ) ) ) ) = if ( A = +oo , +oo , +oo ) )
13		xrpnfdc 9799	. . . 4 |- ( A e. RR* -> DECID A = +oo )
14		ifiddc 3559	. . . 4 |- (DECID A = +oo -> if ( A = +oo , +oo , +oo ) = +oo )
15	13, 14	syl 14	. . 3 |- ( A e. RR* -> if ( A = +oo , +oo , +oo ) = +oo )
16	12, 15	sylan9eqr 2225	. 2 |- ( ( A e. RR* /\ A =/= -oo ) -> if ( A = +oo , if ( +oo = -oo , 0 , +oo ) , if ( A = -oo , if ( +oo = +oo , 0 , -oo ) , if ( +oo = +oo , +oo , if ( +oo = -oo , -oo , ( A + +oo ) ) ) ) ) = +oo )
17	4, 16	eqtrd 2203	1 |- ( ( A e. RR* /\ A =/= -oo ) -> ( A +e +oo ) = +oo )

Syntax hints:   -> wi 4   /\ wa 103  DECID wdc 829   = wceq 1348   e. wcel 2141   =/= wne 2340   ifcif 3526  (class class class)co 5853   0cc0 7774   + caddc 7777   +oocpnf 7951   -oocmnf 7952   RR*cxr 7953   +ecxad 9727

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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-cnex 7865  ax-resscn 7866  ax-1re 7868  ax-addrcl 7871  ax-rnegex 7883

This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-rab 2457  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-iota 5160  df-fun 5200  df-fv 5206  df-ov 5856  df-oprab 5857  df-mpo 5858  df-pnf 7956  df-mnf 7957  df-xr 7958  df-xadd 9730

This theorem is referenced by:  xaddnemnf  9814  xaddcom  9818  xnn0xadd0  9824  xnegdi  9825  xaddass  9826  xleadd1a  9830  xlt2add  9837  xsubge0  9838  xposdif  9839  xlesubadd  9840  xrbdtri  11239  isxmet2d  13142