Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > suplem2pr | Structured version Visualization version Unicode version |
Description: The union of a set of positive reals (if a positive real) is its supremum (the least upper bound). Part of Proposition 9-3.3 of [Gleason] p. 122. (Contributed by NM, 19-May-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.) |
Ref | Expression |
---|---|
suplem2pr |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltrelpr 9820 | . . . . . 6 | |
2 | 1 | brel 5168 | . . . . 5 |
3 | 2 | simpld 475 | . . . 4 |
4 | ralnex 2992 | . . . . . . . . 9 | |
5 | ssel2 3598 | . . . . . . . . . . . 12 | |
6 | ltsopr 9854 | . . . . . . . . . . . . . . . 16 | |
7 | sotric 5061 | . . . . . . . . . . . . . . . 16 | |
8 | 6, 7 | mpan 706 | . . . . . . . . . . . . . . 15 |
9 | 8 | con2bid 344 | . . . . . . . . . . . . . 14 |
10 | 9 | ancoms 469 | . . . . . . . . . . . . 13 |
11 | ltprord 9852 | . . . . . . . . . . . . . . 15 | |
12 | 11 | orbi2d 738 | . . . . . . . . . . . . . 14 |
13 | sspss 3706 | . . . . . . . . . . . . . . 15 | |
14 | equcom 1945 | . . . . . . . . . . . . . . . 16 | |
15 | 14 | orbi2i 541 | . . . . . . . . . . . . . . 15 |
16 | orcom 402 | . . . . . . . . . . . . . . 15 | |
17 | 13, 15, 16 | 3bitri 286 | . . . . . . . . . . . . . 14 |
18 | 12, 17 | syl6bbr 278 | . . . . . . . . . . . . 13 |
19 | 10, 18 | bitr3d 270 | . . . . . . . . . . . 12 |
20 | 5, 19 | sylan 488 | . . . . . . . . . . 11 |
21 | 20 | an32s 846 | . . . . . . . . . 10 |
22 | 21 | ralbidva 2985 | . . . . . . . . 9 |
23 | 4, 22 | syl5bbr 274 | . . . . . . . 8 |
24 | unissb 4469 | . . . . . . . 8 | |
25 | 23, 24 | syl6bbr 278 | . . . . . . 7 |
26 | ssnpss 3710 | . . . . . . . 8 | |
27 | ltprord 9852 | . . . . . . . . . 10 | |
28 | 27 | biimpd 219 | . . . . . . . . 9 |
29 | 2, 28 | mpcom 38 | . . . . . . . 8 |
30 | 26, 29 | nsyl 135 | . . . . . . 7 |
31 | 25, 30 | syl6bi 243 | . . . . . 6 |
32 | 31 | con4d 114 | . . . . 5 |
33 | 32 | ex 450 | . . . 4 |
34 | 3, 33 | syl5 34 | . . 3 |
35 | 34 | pm2.43d 53 | . 2 |
36 | elssuni 4467 | . . . 4 | |
37 | ssnpss 3710 | . . . 4 | |
38 | 36, 37 | syl 17 | . . 3 |
39 | 1 | brel 5168 | . . . 4 |
40 | ltprord 9852 | . . . . 5 | |
41 | 40 | biimpd 219 | . . . 4 |
42 | 39, 41 | mpcom 38 | . . 3 |
43 | 38, 42 | nsyl 135 | . 2 |
44 | 35, 43 | jctil 560 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wb 196 wo 383 wa 384 wcel 1990 wral 2912 wrex 2913 wss 3574 wpss 3575 cuni 4436 class class class wbr 4653 wor 5034 cnp 9681 cltp 9685 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-oadd 7564 df-omul 7565 df-er 7742 df-ni 9694 df-mi 9696 df-lti 9697 df-ltpq 9732 df-enq 9733 df-nq 9734 df-ltnq 9740 df-np 9803 df-ltp 9807 |
This theorem is referenced by: supexpr 9876 |
Copyright terms: Public domain | W3C validator |