ltaddpr - Intuitionistic Logic Explorer

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

Theorem ltaddpr 7598

Description: The sum of two positive reals is greater than one of them. Proposition 9-3.5(iii) of [Gleason] p. 123. (Contributed by NM, 26-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.)

**Assertion**
Ref	Expression
ltaddpr	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → 𝐴<_P (𝐴 +_P 𝐵))

Proof of Theorem ltaddpr Dummy variables 𝑓 𝑔 ℎ 𝑥 𝑦 𝑝 𝑞 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prop 7476	. . . 4 ⊢ (𝐵 ∈ P → ⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P)
2		prml 7478	. . . 4 ⊢ (⟨(1^st ‘𝐵), (2^nd ‘𝐵)⟩ ∈ P → ∃𝑝 ∈ Q 𝑝 ∈ (1^st ‘𝐵))
3	1, 2	syl 14	. . 3 ⊢ (𝐵 ∈ P → ∃𝑝 ∈ Q 𝑝 ∈ (1^st ‘𝐵))
4	3	adantl 277	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∃𝑝 ∈ Q 𝑝 ∈ (1^st ‘𝐵))
5		prop 7476	. . . . 5 ⊢ (𝐴 ∈ P → ⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P)
6		prarloc 7504	. . . . 5 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑝 ∈ Q) → ∃𝑟 ∈ (1^st ‘𝐴)∃𝑞 ∈ (2^nd ‘𝐴)𝑞 <_Q (𝑟 +_Q 𝑝))
7	5, 6	sylan 283	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝑝 ∈ Q) → ∃𝑟 ∈ (1^st ‘𝐴)∃𝑞 ∈ (2^nd ‘𝐴)𝑞 <_Q (𝑟 +_Q 𝑝))
8	7	ad2ant2r 509	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵))) → ∃𝑟 ∈ (1^st ‘𝐴)∃𝑞 ∈ (2^nd ‘𝐴)𝑞 <_Q (𝑟 +_Q 𝑝))
9		elprnqu 7483	. . . . . . . . . . 11 ⊢ ((⟨(1^st ‘𝐴), (2^nd ‘𝐴)⟩ ∈ P ∧ 𝑞 ∈ (2^nd ‘𝐴)) → 𝑞 ∈ Q)
10	5, 9	sylan 283	. . . . . . . . . 10 ⊢ ((𝐴 ∈ P ∧ 𝑞 ∈ (2^nd ‘𝐴)) → 𝑞 ∈ Q)
11	10	adantlr 477	. . . . . . . . 9 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝑞 ∈ (2^nd ‘𝐴)) → 𝑞 ∈ Q)
12	11	ad2ant2rl 511	. . . . . . . 8 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵))) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) → 𝑞 ∈ Q)
13	12	adantr 276	. . . . . . 7 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵))) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) ∧ 𝑞 <_Q (𝑟 +_Q 𝑝)) → 𝑞 ∈ Q)
14		simplrr 536	. . . . . . 7 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵))) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) ∧ 𝑞 <_Q (𝑟 +_Q 𝑝)) → 𝑞 ∈ (2^nd ‘𝐴))
15		simprl 529	. . . . . . . . . . . . 13 ⊢ (((𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵)) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) → 𝑟 ∈ (1^st ‘𝐴))
16		simplr 528	. . . . . . . . . . . . 13 ⊢ (((𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵)) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) → 𝑝 ∈ (1^st ‘𝐵))
17	15, 16	jca 306	. . . . . . . . . . . 12 ⊢ (((𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵)) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) → (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑝 ∈ (1^st ‘𝐵)))
18		df-iplp 7469	. . . . . . . . . . . . 13 ⊢ +_P = (𝑥 ∈ P, 𝑦 ∈ P ↦ ⟨{𝑓 ∈ Q ∣ ∃𝑔 ∈ Q ∃ℎ ∈ Q (𝑔 ∈ (1^st ‘𝑥) ∧ ℎ ∈ (1^st ‘𝑦) ∧ 𝑓 = (𝑔 +_Q ℎ))}, {𝑓 ∈ Q ∣ ∃𝑔 ∈ Q ∃ℎ ∈ Q (𝑔 ∈ (2^nd ‘𝑥) ∧ ℎ ∈ (2^nd ‘𝑦) ∧ 𝑓 = (𝑔 +_Q ℎ))}⟩)
19		addclnq 7376	. . . . . . . . . . . . 13 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑔 +_Q ℎ) ∈ Q)
20	18, 19	genpprecll 7515	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝑟 ∈ (1^st ‘𝐴) ∧ 𝑝 ∈ (1^st ‘𝐵)) → (𝑟 +_Q 𝑝) ∈ (1^st ‘(𝐴 +_P 𝐵))))
21	17, 20	syl5 32	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵)) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) → (𝑟 +_Q 𝑝) ∈ (1^st ‘(𝐴 +_P 𝐵))))
22	21	imdistani 445	. . . . . . . . . 10 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ ((𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵)) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴)))) → ((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑟 +_Q 𝑝) ∈ (1^st ‘(𝐴 +_P 𝐵))))
23		addclpr 7538	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 +_P 𝐵) ∈ P)
24		prop 7476	. . . . . . . . . . . 12 ⊢ ((𝐴 +_P 𝐵) ∈ P → ⟨(1^st ‘(𝐴 +_P 𝐵)), (2^nd ‘(𝐴 +_P 𝐵))⟩ ∈ P)
25		prcdnql 7485	. . . . . . . . . . . 12 ⊢ ((⟨(1^st ‘(𝐴 +_P 𝐵)), (2^nd ‘(𝐴 +_P 𝐵))⟩ ∈ P ∧ (𝑟 +_Q 𝑝) ∈ (1^st ‘(𝐴 +_P 𝐵))) → (𝑞 <_Q (𝑟 +_Q 𝑝) → 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵))))
26	24, 25	sylan 283	. . . . . . . . . . 11 ⊢ (((𝐴 +_P 𝐵) ∈ P ∧ (𝑟 +_Q 𝑝) ∈ (1^st ‘(𝐴 +_P 𝐵))) → (𝑞 <_Q (𝑟 +_Q 𝑝) → 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵))))
27	23, 26	sylan 283	. . . . . . . . . 10 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑟 +_Q 𝑝) ∈ (1^st ‘(𝐴 +_P 𝐵))) → (𝑞 <_Q (𝑟 +_Q 𝑝) → 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵))))
28	22, 27	syl 14	. . . . . . . . 9 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ ((𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵)) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴)))) → (𝑞 <_Q (𝑟 +_Q 𝑝) → 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵))))
29	28	anassrs 400	. . . . . . . 8 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵))) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) → (𝑞 <_Q (𝑟 +_Q 𝑝) → 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵))))
30	29	imp 124	. . . . . . 7 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵))) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) ∧ 𝑞 <_Q (𝑟 +_Q 𝑝)) → 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)))
31		rspe 2526	. . . . . . 7 ⊢ ((𝑞 ∈ Q ∧ (𝑞 ∈ (2^nd ‘𝐴) ∧ 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)))) → ∃𝑞 ∈ Q (𝑞 ∈ (2^nd ‘𝐴) ∧ 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵))))
32	13, 14, 30, 31	syl12anc 1236	. . . . . 6 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵))) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) ∧ 𝑞 <_Q (𝑟 +_Q 𝑝)) → ∃𝑞 ∈ Q (𝑞 ∈ (2^nd ‘𝐴) ∧ 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵))))
33		ltdfpr 7507	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ (𝐴 +_P 𝐵) ∈ P) → (𝐴<_P (𝐴 +_P 𝐵) ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2^nd ‘𝐴) ∧ 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)))))
34	23, 33	syldan 282	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴<_P (𝐴 +_P 𝐵) ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2^nd ‘𝐴) ∧ 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)))))
35	34	ad3antrrr 492	. . . . . 6 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵))) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) ∧ 𝑞 <_Q (𝑟 +_Q 𝑝)) → (𝐴<_P (𝐴 +_P 𝐵) ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2^nd ‘𝐴) ∧ 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)))))
36	32, 35	mpbird 167	. . . . 5 ⊢ (((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵))) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) ∧ 𝑞 <_Q (𝑟 +_Q 𝑝)) → 𝐴<_P (𝐴 +_P 𝐵))
37	36	ex 115	. . . 4 ⊢ ((((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵))) ∧ (𝑟 ∈ (1^st ‘𝐴) ∧ 𝑞 ∈ (2^nd ‘𝐴))) → (𝑞 <_Q (𝑟 +_Q 𝑝) → 𝐴<_P (𝐴 +_P 𝐵)))
38	37	rexlimdvva 2602	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵))) → (∃𝑟 ∈ (1^st ‘𝐴)∃𝑞 ∈ (2^nd ‘𝐴)𝑞 <_Q (𝑟 +_Q 𝑝) → 𝐴<_P (𝐴 +_P 𝐵)))
39	8, 38	mpd 13	. 2 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑝 ∈ Q ∧ 𝑝 ∈ (1^st ‘𝐵))) → 𝐴<_P (𝐴 +_P 𝐵))
40	4, 39	rexlimddv 2599	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → 𝐴<_P (𝐴 +_P 𝐵))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2148 ∃wrex 2456 ⟨cop 3597 class class class wbr 4005 ‘cfv 5218 (class class class)co 5877 1^st c1st 6141 2^nd c2nd 6142 Qcnq 7281 +_Q cplq 7283 <_Q cltq 7286 Pcnp 7292 +_P cpp 7294 <_P cltp 7296

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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4120 ax-sep 4123 ax-nul 4131 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-iinf 4589

This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-nul 3425 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-iun 3890 df-br 4006 df-opab 4067 df-mpt 4068 df-tr 4104 df-eprel 4291 df-id 4295 df-po 4298 df-iso 4299 df-iord 4368 df-on 4370 df-suc 4373 df-iom 4592 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-f1 5223 df-fo 5224 df-f1o 5225 df-fv 5226 df-ov 5880 df-oprab 5881 df-mpo 5882 df-1st 6143 df-2nd 6144 df-recs 6308 df-irdg 6373 df-1o 6419 df-2o 6420 df-oadd 6423 df-omul 6424 df-er 6537 df-ec 6539 df-qs 6543 df-ni 7305 df-pli 7306 df-mi 7307 df-lti 7308 df-plpq 7345 df-mpq 7346 df-enq 7348 df-nqqs 7349 df-plqqs 7350 df-mqqs 7351 df-1nqqs 7352 df-rq 7353 df-ltnqqs 7354 df-enq0 7425 df-nq0 7426 df-0nq0 7427 df-plq0 7428 df-mq0 7429 df-inp 7467 df-iplp 7469 df-iltp 7471

This theorem is referenced by: ltexprlemrl 7611 ltaprlem 7619 ltaprg 7620 prplnqu 7621 ltmprr 7643 caucvgprprlemnkltj 7690 caucvgprprlemnkeqj 7691 caucvgprprlemnbj 7694 0lt1sr 7766 recexgt0sr 7774 mulgt0sr 7779 archsr 7783 prsrpos 7786 mappsrprg 7805 pitoregt0 7850

W3C validator