addclpr - Intuitionistic Logic Explorer

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

Theorem addclpr 7894

Description: Closure of addition on positive reals. First statement of Proposition 9-3.5 of [Gleason] p. 123. Combination of Lemma 11.13 and Lemma 11.16 in [BauerTaylor], p. 53. (Contributed by NM, 13-Mar-1996.)

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

Proof of Theorem addclpr Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑔 ℎ 𝑞 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-iplp 7825	. . . 4 ⊢ +_P = (𝑤 ∈ P, 𝑣 ∈ P ↦ ⟨{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1^st ‘𝑤) ∧ 𝑧 ∈ (1^st ‘𝑣) ∧ 𝑥 = (𝑦 +_Q 𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2^nd ‘𝑤) ∧ 𝑧 ∈ (2^nd ‘𝑣) ∧ 𝑥 = (𝑦 +_Q 𝑧))}⟩)
2	1	genpelxp 7868	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 +_P 𝐵) ∈ (𝒫 Q × 𝒫 Q))
3		addclnq 7732	. . . 4 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦 +_Q 𝑧) ∈ Q)
4	1, 3	genpml 7874	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)))
5	1, 3	genpmu 7875	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘(𝐴 +_P 𝐵)))
6	2, 4, 5	jca32 310	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐴 +_P 𝐵) ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘(𝐴 +_P 𝐵)))))
7		ltanqg 7757	. . . . 5 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑥 <_Q 𝑦 ↔ (𝑧 +_Q 𝑥) <_Q (𝑧 +_Q 𝑦)))
8		addcomnqg 7738	. . . . 5 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → (𝑥 +_Q 𝑦) = (𝑦 +_Q 𝑥))
9		addnqprl 7886	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝑔 ∈ (1^st ‘𝐴)) ∧ (𝐵 ∈ P ∧ ℎ ∈ (1^st ‘𝐵))) ∧ 𝑥 ∈ Q) → (𝑥 <_Q (𝑔 +_Q ℎ) → 𝑥 ∈ (1^st ‘(𝐴 +_P 𝐵))))
10	1, 3, 7, 8, 9	genprndl 7878	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘(𝐴 +_P 𝐵)))))
11		addnqpru 7887	. . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝑔 ∈ (2^nd ‘𝐴)) ∧ (𝐵 ∈ P ∧ ℎ ∈ (2^nd ‘𝐵))) ∧ 𝑥 ∈ Q) → ((𝑔 +_Q ℎ) <_Q 𝑥 → 𝑥 ∈ (2^nd ‘(𝐴 +_P 𝐵))))
12	1, 3, 7, 8, 11	genprndu 7879	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘(𝐴 +_P 𝐵)) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘(𝐴 +_P 𝐵)))))
13	10, 12	jca 306	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘(𝐴 +_P 𝐵)))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘(𝐴 +_P 𝐵)) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘(𝐴 +_P 𝐵))))))
14	1, 3, 7, 8	genpdisj 7880	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∀𝑞 ∈ Q ¬ (𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴 +_P 𝐵))))
15		addlocpr 7893	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <_Q 𝑟 → (𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)) ∨ 𝑟 ∈ (2^nd ‘(𝐴 +_P 𝐵)))))
16	13, 14, 15	3jca 1208	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘(𝐴 +_P 𝐵)))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘(𝐴 +_P 𝐵)) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘(𝐴 +_P 𝐵))))) ∧ ∀𝑞 ∈ Q ¬ (𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴 +_P 𝐵))) ∧ ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <_Q 𝑟 → (𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)) ∨ 𝑟 ∈ (2^nd ‘(𝐴 +_P 𝐵))))))
17		elnp1st2nd 7833	. 2 ⊢ ((𝐴 +_P 𝐵) ∈ P ↔ (((𝐴 +_P 𝐵) ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘(𝐴 +_P 𝐵)))) ∧ ((∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘(𝐴 +_P 𝐵)))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘(𝐴 +_P 𝐵)) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘(𝐴 +_P 𝐵))))) ∧ ∀𝑞 ∈ Q ¬ (𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)) ∧ 𝑞 ∈ (2^nd ‘(𝐴 +_P 𝐵))) ∧ ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <_Q 𝑟 → (𝑞 ∈ (1^st ‘(𝐴 +_P 𝐵)) ∨ 𝑟 ∈ (2^nd ‘(𝐴 +_P 𝐵)))))))
18	6, 16, 17	sylanbrc 421	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 +_P 𝐵) ∈ P)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 720 ∧ w3a 1009 ∈ wcel 2209 ∀wral 2528 ∃wrex 2529 𝒫 cpw 3685 class class class wbr 4125 × cxp 4767 ‘cfv 5372 (class class class)co 6075 1^st c1st 6362 2^nd c2nd 6363 Qcnq 7637 +_Q cplq 7639 <_Q cltq 7642 Pcnp 7648 +_P cpp 7650

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-coll 4241 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-iinf 4730

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-ral 2533 df-rex 2534 df-reu 2535 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-nul 3521 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-eprel 4429 df-id 4433 df-po 4436 df-iso 4437 df-iord 4506 df-on 4508 df-suc 4511 df-iom 4733 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-recs 6566 df-irdg 6631 df-1o 6677 df-2o 6678 df-oadd 6681 df-omul 6682 df-er 6797 df-ec 6799 df-qs 6803 df-ni 7661 df-pli 7662 df-mi 7663 df-lti 7664 df-plpq 7701 df-mpq 7702 df-enq 7704 df-nqqs 7705 df-plqqs 7706 df-mqqs 7707 df-1nqqs 7708 df-rq 7709 df-ltnqqs 7710 df-enq0 7781 df-nq0 7782 df-0nq0 7783 df-plq0 7784 df-mq0 7785 df-inp 7823 df-iplp 7825

This theorem is referenced by: addnqprlemfl 7916 addnqprlemfu 7917 addnqpr 7918 addassprg 7936 distrlem1prl 7939 distrlem1pru 7940 distrlem4prl 7941 distrlem4pru 7942 distrprg 7945 ltaddpr 7954 ltexpri 7970 addcanprleml 7971 addcanprlemu 7972 ltaprlem 7975 ltaprg 7976 prplnqu 7977 addextpr 7978 caucvgprlemcanl 8001 cauappcvgprlemladdru 8013 cauappcvgprlemladdrl 8014 cauappcvgprlemladd 8015 cauappcvgprlem1 8016 caucvgprlemladdrl 8035 caucvgprlem1 8036 caucvgprprlemnbj 8050 caucvgprprlemopu 8056 caucvgprprlemloc 8060 caucvgprprlemexbt 8063 caucvgprprlemexb 8064 caucvgprprlemaddq 8065 caucvgprprlem2 8067 enrer 8092 addcmpblnr 8096 mulcmpblnrlemg 8097 mulcmpblnr 8098 ltsrprg 8104 1sr 8108 m1r 8109 addclsr 8110 mulclsr 8111 addasssrg 8113 mulasssrg 8115 distrsrg 8116 m1p1sr 8117 m1m1sr 8118 lttrsr 8119 ltsosr 8121 0lt1sr 8122 0idsr 8124 1idsr 8125 00sr 8126 ltasrg 8127 recexgt0sr 8130 mulgt0sr 8135 aptisr 8136 mulextsr1lem 8137 mulextsr1 8138 archsr 8139 srpospr 8140 prsrcl 8141 prsradd 8143 prsrlt 8144 caucvgsrlemcau 8150 caucvgsrlemgt1 8152 mappsrprg 8161 map2psrprg 8162 pitonnlem1p1 8203 pitonnlem2 8204 pitonn 8205 pitoregt0 8206 pitore 8207 recnnre 8208 recidpirqlemcalc 8214 recidpirq 8215

W3C validator