| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Lemma for supremum theorem. |
| Ref | Expression |
|---|---|
| supsrlem.1 | ⊢ C ∈ R |
| supsrlem.2 | ⊢ B = {w∣(C +R (w +R -1R)) ∈ A} |
| Ref | Expression |
|---|---|
| supsrlem5 | ⊢ (C ∈ A → ∃y(y ∈ B ∧ 0R <R y)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | supsrlem.1 | . . . 4 ⊢ C ∈ R | |
| 2 | supsrlem.2 | . . . 4 ⊢ B = {w∣(C +R (w +R -1R)) ∈ A} | |
| 3 | 1r 3984 | . . . . 5 ⊢ 1R ∈ R | |
| 4 | 3 | elisseti 1355 | . . . 4 ⊢ 1R ∈ V |
| 5 | 1, 2, 4 | supsrlem4 4022 | . . 3 ⊢ (1R ∈ B ↔ (C +R (1R +R -1R)) ∈ A) |
| 6 | 0lt1sr 3998 | . . . 4 ⊢ 0R <R 1R | |
| 7 | 6 | biantru 543 | . . 3 ⊢ (1R ∈ B ↔ (1R ∈ B ∧ 0R <R 1R)) |
| 8 | m1r 3985 | . . . . . . . . 9 ⊢ -1R ∈ R | |
| 9 | 8 | elisseti 1355 | . . . . . . . 8 ⊢ -1R ∈ V |
| 10 | 4, 9 | addcomsr 3990 | . . . . . . 7 ⊢ (1R +R -1R) = (-1R +R 1R) |
| 11 | m1p1sr 3995 | . . . . . . 7 ⊢ (-1R +R 1R) = 0R | |
| 12 | 10, 11 | eqtr 1119 | . . . . . 6 ⊢ (1R +R -1R) = 0R |
| 13 | 12 | opreq2i 3010 | . . . . 5 ⊢ (C +R (1R +R -1R)) = (C +R 0R) |
| 14 | 0idsr 4000 | . . . . . 6 ⊢ (C ∈ R → (C +R 0R) = C) | |
| 15 | 1, 14 | ax-mp 6 | . . . . 5 ⊢ (C +R 0R) = C |
| 16 | 13, 15 | eqtr 1119 | . . . 4 ⊢ (C +R (1R +R -1R)) = C |
| 17 | 16 | eleq1i 1152 | . . 3 ⊢ ((C +R (1R +R -1R)) ∈ A ↔ C ∈ A) |
| 18 | 5, 7, 17 | 3bitr3 156 | . 2 ⊢ ((1R ∈ B ∧ 0R <R 1R) ↔ C ∈ A) |
| 19 | eleq1 1149 | . . . 4 ⊢ (y = 1R → (y ∈ B ↔ 1R ∈ B)) | |
| 20 | breq2 2066 | . . . 4 ⊢ (y = 1R → (0R <R y ↔ 0R <R 1R)) | |
| 21 | 19, 20 | anbi12d 476 | . . 3 ⊢ (y = 1R → ((y ∈ B ∧ 0R <R y) ↔ (1R ∈ B ∧ 0R <R 1R))) |
| 22 | 4, 21 | cla4ev 1401 | . 2 ⊢ ((1R ∈ B ∧ 0R <R 1R) → ∃y(y ∈ B ∧ 0R <R y)) |
| 23 | 18, 22 | sylbir 176 | 1 ⊢ (C ∈ A → ∃y(y ∈ B ∧ 0R <R y)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 2 ∧ wa 196 ∃wex 678 {cab 1090 = wceq 1091 ∈ wcel 1092 class class class wbr 2054 (class class class)co 3001 Rcnr 3787 0Rc0r 3788 1Rc1r 3789 -1Rcm1r 3790 +R cplr 3791 <R cltr 3793 |
| This theorem is referenced by: supsrlem6 4024 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-un 1076 ax-pow 1077 ax-reg 1078 ax-inf 1079 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-3or 582 df-3an 583 df-ex 679 df-sb 853 df-eu 1009 df-mo 1010 df-clab 1093 df-cleq 1097 df-clel 1099 df-ne 1192 df-ral 1205 df-rex 1206 df-reu 1207 df-rab 1208 df-v 1349 df-sbc 1441 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-pss 1494 df-nul 1708 df-if 1777 df-pw 1799 df-sn 1811 df-pr 1812 df-tp 1814 df-op 1815 df-uni 1920 df-int 1966 df-iun 1996 df-tr 2042 df-br 2063 df-opab 2098 df-eprel 2122 df-id 2125 df-po 2128 df-so 2138 df-fr 2169 df-we 2186 df-ord 2202 df-on 2203 df-lim 2204 df-suc 2205 df-om 2373 df-xp 2424 df-rel 2425 df-cnv 2426 df-co 2427 df-dm 2428 df-rn 2429 df-res 2430 df-ima 2431 df-fun 2432 df-fn 2433 df-f 2434 df-f1 2435 df-fv 2438 df-rdg 2970 df-opr 3003 df-oprab 3004 df-1o 3104 df-oadd 3106 df-omul 3107 df-er 3200 df-ec 3202 df-qs 3205 df-ni 3794 df-pli 3795 df-mi 3796 df-lti 3797 df-plpq 3829 df-mpq 3830 df-enq 3831 df-nq 3832 df-plq 3833 df-mq 3834 df-rq 3835 df-ltq 3836 df-1q 3837 df-np 3880 df-1p 3881 df-plp 3882 df-ltp 3884 df-plpr 3958 df-enr 3960 df-nr 3961 df-plr 3962 df-ltr 3964 df-0r 3965 df-1r 3966 df-m1r 3967 |