addclpr - Intuitionistic Logic Explorer

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

Theorem addclpr 6519

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	⊢ ((A ∈ P ∧ B ∈ P) → (A +_P B) ∈ P)

Proof of Theorem addclpr Dummy variables x y z w v g ℎ 𝑞 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-iplp 6450	. . . 4 ⊢ +_P = (w ∈ P, v ∈ P ↦ ⟨{x ∈ Q ∣ ∃y ∈ Q ∃z ∈ Q (y ∈ (1^st ‘w) ∧ z ∈ (1^st ‘v) ∧ x = (y +_Q z))}, {x ∈ Q ∣ ∃y ∈ Q ∃z ∈ Q (y ∈ (2^nd ‘w) ∧ z ∈ (2^nd ‘v) ∧ x = (y +_Q z))}⟩)
2	1	genpelxp 6493	. . 3 ⊢ ((A ∈ P ∧ B ∈ P) → (A +_P B) ∈ (𝒫 Q × 𝒫 Q))
3		addclnq 6359	. . . 4 ⊢ ((y ∈ Q ∧ z ∈ Q) → (y +_Q z) ∈ Q)
4	1, 3	genpml 6499	. . 3 ⊢ ((A ∈ P ∧ B ∈ P) → ∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘(A +_P B)))
5	1, 3	genpmu 6500	. . 3 ⊢ ((A ∈ P ∧ B ∈ P) → ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘(A +_P B)))
6	2, 4, 5	jca32 293	. 2 ⊢ ((A ∈ P ∧ B ∈ P) → ((A +_P B) ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘(A +_P B)) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘(A +_P B)))))
7		ltanqg 6384	. . . . 5 ⊢ ((x ∈ Q ∧ y ∈ Q ∧ z ∈ Q) → (x <_Q y ↔ (z +_Q x) <_Q (z +_Q y)))
8		addcomnqg 6365	. . . . 5 ⊢ ((x ∈ Q ∧ y ∈ Q) → (x +_Q y) = (y +_Q x))
9		addnqprl 6511	. . . . 5 ⊢ ((((A ∈ P ∧ g ∈ (1^st ‘A)) ∧ (B ∈ P ∧ ℎ ∈ (1^st ‘B))) ∧ x ∈ Q) → (x <_Q (g +_Q ℎ) → x ∈ (1^st ‘(A +_P B))))
10	1, 3, 7, 8, 9	genprndl 6503	. . . 4 ⊢ ((A ∈ P ∧ B ∈ P) → ∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘(A +_P B)) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘(A +_P B)))))
11		addnqpru 6512	. . . . 5 ⊢ ((((A ∈ P ∧ g ∈ (2^nd ‘A)) ∧ (B ∈ P ∧ ℎ ∈ (2^nd ‘B))) ∧ x ∈ Q) → ((g +_Q ℎ) <_Q x → x ∈ (2^nd ‘(A +_P B))))
12	1, 3, 7, 8, 11	genprndu 6504	. . . 4 ⊢ ((A ∈ P ∧ B ∈ P) → ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘(A +_P B)) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘(A +_P B)))))
13	10, 12	jca 290	. . 3 ⊢ ((A ∈ P ∧ B ∈ P) → (∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘(A +_P B)) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘(A +_P B)))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘(A +_P B)) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘(A +_P B))))))
14	1, 3, 7, 8	genpdisj 6505	. . 3 ⊢ ((A ∈ P ∧ B ∈ P) → ∀𝑞 ∈ Q ¬ (𝑞 ∈ (1^st ‘(A +_P B)) ∧ 𝑞 ∈ (2^nd ‘(A +_P B))))
15		addlocpr 6518	. . 3 ⊢ ((A ∈ P ∧ B ∈ P) → ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <_Q 𝑟 → (𝑞 ∈ (1^st ‘(A +_P B)) ∨ 𝑟 ∈ (2^nd ‘(A +_P B)))))
16	13, 14, 15	3jca 1083	. 2 ⊢ ((A ∈ P ∧ B ∈ P) → ((∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘(A +_P B)) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘(A +_P B)))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘(A +_P B)) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘(A +_P B))))) ∧ ∀𝑞 ∈ Q ¬ (𝑞 ∈ (1^st ‘(A +_P B)) ∧ 𝑞 ∈ (2^nd ‘(A +_P B))) ∧ ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <_Q 𝑟 → (𝑞 ∈ (1^st ‘(A +_P B)) ∨ 𝑟 ∈ (2^nd ‘(A +_P B))))))
17		elnp1st2nd 6458	. 2 ⊢ ((A +_P B) ∈ P ↔ (((A +_P B) ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞 ∈ Q 𝑞 ∈ (1^st ‘(A +_P B)) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2^nd ‘(A +_P B)))) ∧ ((∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘(A +_P B)) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘(A +_P B)))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘(A +_P B)) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘(A +_P B))))) ∧ ∀𝑞 ∈ Q ¬ (𝑞 ∈ (1^st ‘(A +_P B)) ∧ 𝑞 ∈ (2^nd ‘(A +_P B))) ∧ ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <_Q 𝑟 → (𝑞 ∈ (1^st ‘(A +_P B)) ∨ 𝑟 ∈ (2^nd ‘(A +_P B)))))))
18	6, 16, 17	sylanbrc 394	1 ⊢ ((A ∈ P ∧ B ∈ P) → (A +_P B) ∈ P)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 97 ↔ wb 98 ∨ wo 628 ∧ w3a 884 ∈ wcel 1390 ∀wral 2300 ∃wrex 2301 𝒫 cpw 3351 class class class wbr 3755 × cxp 4286 ‘cfv 4845 (class class class)co 5455 1^st c1st 5707 2^nd c2nd 5708 Qcnq 6264 +_Q cplq 6266 <_Q cltq 6269 Pcnp 6275 +_P cpp 6277

This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 629 ax-5 1333 ax-7 1334 ax-gen 1335 ax-ie1 1379 ax-ie2 1380 ax-8 1392 ax-10 1393 ax-11 1394 ax-i12 1395 ax-bnd 1396 ax-4 1397 ax-13 1401 ax-14 1402 ax-17 1416 ax-i9 1420 ax-ial 1424 ax-i5r 1425 ax-ext 2019 ax-coll 3863 ax-sep 3866 ax-nul 3874 ax-pow 3918 ax-pr 3935 ax-un 4136 ax-setind 4220 ax-iinf 4254

This theorem depends on definitions: df-bi 110 df-dc 742 df-3or 885 df-3an 886 df-tru 1245 df-fal 1248 df-nf 1347 df-sb 1643 df-eu 1900 df-mo 1901 df-clab 2024 df-cleq 2030 df-clel 2033 df-nfc 2164 df-ne 2203 df-ral 2305 df-rex 2306 df-reu 2307 df-rab 2309 df-v 2553 df-sbc 2759 df-csb 2847 df-dif 2914 df-un 2916 df-in 2918 df-ss 2925 df-nul 3219 df-pw 3353 df-sn 3373 df-pr 3374 df-op 3376 df-uni 3572 df-int 3607 df-iun 3650 df-br 3756 df-opab 3810 df-mpt 3811 df-tr 3846 df-eprel 4017 df-id 4021 df-po 4024 df-iso 4025 df-iord 4069 df-on 4071 df-suc 4074 df-iom 4257 df-xp 4294 df-rel 4295 df-cnv 4296 df-co 4297 df-dm 4298 df-rn 4299 df-res 4300 df-ima 4301 df-iota 4810 df-fun 4847 df-fn 4848 df-f 4849 df-f1 4850 df-fo 4851 df-f1o 4852 df-fv 4853 df-ov 5458 df-oprab 5459 df-mpt2 5460 df-1st 5709 df-2nd 5710 df-recs 5861 df-irdg 5897 df-1o 5940 df-2o 5941 df-oadd 5944 df-omul 5945 df-er 6042 df-ec 6044 df-qs 6048 df-ni 6288 df-pli 6289 df-mi 6290 df-lti 6291 df-plpq 6328 df-mpq 6329 df-enq 6331 df-nqqs 6332 df-plqqs 6333 df-mqqs 6334 df-1nqqs 6335 df-rq 6336 df-ltnqqs 6337 df-enq0 6406 df-nq0 6407 df-0nq0 6408 df-plq0 6409 df-mq0 6410 df-inp 6448 df-iplp 6450

This theorem is referenced by: addnqprlemfl 6539 addnqprlemfu 6540 addnqpr 6541 addassprg 6554 distrlem1prl 6557 distrlem1pru 6558 distrlem4prl 6559 distrlem4pru 6560 distrprg 6563 ltaddpr 6570 ltexpri 6586 addcanprleml 6587 addcanprlemu 6588 ltaprlem 6590 ltaprg 6591 addextpr 6592 cauappcvgprlemcan 6615 cauappcvgprlemladdru 6627 cauappcvgprlemladdrl 6628 cauappcvgprlemladd 6629 cauappcvgprlem1 6630 enrer 6643 addcmpblnr 6647 mulcmpblnrlemg 6648 mulcmpblnr 6649 ltsrprg 6655 1sr 6659 m1r 6660 addclsr 6661 mulclsr 6662 addasssrg 6664 mulasssrg 6666 distrsrg 6667 m1p1sr 6668 m1m1sr 6669 lttrsr 6670 ltsosr 6672 0lt1sr 6673 0idsr 6675 1idsr 6676 00sr 6677 ltasrg 6678 recexgt0sr 6681 mulgt0sr 6684 aptisr 6685 mulextsr1lem 6686 mulextsr1 6687 archsr 6688 pitonnlem1p1 6722 pitonnlem2 6723 pitonn 6724

W3C validator