Theorem ltaprlem 7837

Description: Lemma for Proposition 9-3.5(v) of [Gleason] p. 123. (Contributed by NM, 8-Apr-1996.)

Assertion

Ref	Expression
ltaprlem	|- ( C e. P. -> ( A <P B -> ( C +P. A ) <P ( C +P. B ) ) )

Proof of Theorem ltaprlem

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltexpri 7832	. . . 4 |- ( A <P B -> E. x e. P. ( A +P. x ) = B )
2	1	adantr 276	. . 3 |- ( ( A <P B /\ C e. P. ) -> E. x e. P. ( A +P. x ) = B )
3		simplr 529	. . . . . 6 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> C e. P. )
4		ltrelpr 7724	. . . . . . . . . 10 |- <P C_ ( P. X. P. )
5	4	brel 4778	. . . . . . . . 9 |- ( A <P B -> ( A e. P. /\ B e. P. ) )
6	5	simpld 112	. . . . . . . 8 |- ( A <P B -> A e. P. )
7	6	adantr 276	. . . . . . 7 |- ( ( A <P B /\ C e. P. ) -> A e. P. )
8	7	adantr 276	. . . . . 6 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> A e. P. )
9		addclpr 7756	. . . . . 6 |- ( ( C e. P. /\ A e. P. ) -> ( C +P. A ) e. P. )
10	3, 8, 9	syl2anc 411	. . . . 5 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> ( C +P. A ) e. P. )
11		simprl 531	. . . . 5 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> x e. P. )
12		ltaddpr 7816	. . . . 5 |- ( ( ( C +P. A ) e. P. /\ x e. P. ) -> ( C +P. A ) <P ( ( C +P. A ) +P. x ) )
13	10, 11, 12	syl2anc 411	. . . 4 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> ( C +P. A ) <P ( ( C +P. A ) +P. x ) )
14		addassprg 7798	. . . . . 6 |- ( ( C e. P. /\ A e. P. /\ x e. P. ) -> ( ( C +P. A ) +P. x ) = ( C +P. ( A +P. x ) ) )
15	3, 8, 11, 14	syl3anc 1273	. . . . 5 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> ( ( C +P. A ) +P. x ) = ( C +P. ( A +P. x ) ) )
16		oveq2 6025	. . . . . 6 |- ( ( A +P. x ) = B -> ( C +P. ( A +P. x ) ) = ( C +P. B ) )
17	16	ad2antll 491	. . . . 5 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> ( C +P. ( A +P. x ) ) = ( C +P. B ) )
18	15, 17	eqtrd 2264	. . . 4 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> ( ( C +P. A ) +P. x ) = ( C +P. B ) )
19	13, 18	breqtrd 4114	. . 3 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> ( C +P. A ) <P ( C +P. B ) )
20	2, 19	rexlimddv 2655	. 2 |- ( ( A <P B /\ C e. P. ) -> ( C +P. A ) <P ( C +P. B ) )
21	20	expcom 116	1 |- ( C e. P. -> ( A <P B -> ( C +P. A ) <P ( C +P. B ) ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1397   e. wcel 2202   E.wrex 2511   class class class wbr 4088  (class class class)co 6017   P.cnp 7510   +P. cpp 7512   <P cltp 7514

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-eprel 4386  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-irdg 6535  df-1o 6581  df-2o 6582  df-oadd 6585  df-omul 6586  df-er 6701  df-ec 6703  df-qs 6707  df-ni 7523  df-pli 7524  df-mi 7525  df-lti 7526  df-plpq 7563  df-mpq 7564  df-enq 7566  df-nqqs 7567  df-plqqs 7568  df-mqqs 7569  df-1nqqs 7570  df-rq 7571  df-ltnqqs 7572  df-enq0 7643  df-nq0 7644  df-0nq0 7645  df-plq0 7646  df-mq0 7647  df-inp 7685  df-iplp 7687  df-iltp 7689

This theorem is referenced by:  ltaprg  7838