| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Mapping of non-empty subset from signed reals to reals. |
| Ref | Expression |
|---|---|
| supre.1 | ⊢ B = {w∣〈w, 0R〉 ∈ A} |
| Ref | Expression |
|---|---|
| suprelem | ⊢ ((A ⊆ ℝ ⋀ ¬ A = ∅) → (B ⊆ R ⋀ ¬ B = ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssel 2072 | . . . . . 6 ⊢ (A ⊆ ℝ → (〈w, 0R〉 ∈ A → 〈w, 0R〉 ∈ ℝ)) | |
| 2 | supre.1 | . . . . . . 7 ⊢ B = {w∣〈w, 0R〉 ∈ A} | |
| 3 | 2 | abeq2i 1577 | . . . . . 6 ⊢ (w ∈ B ↔ 〈w, 0R〉 ∈ A) |
| 4 | 1, 3 | syl5ib 206 | . . . . 5 ⊢ (A ⊆ ℝ → (w ∈ B → 〈w, 0R〉 ∈ ℝ)) |
| 5 | opelreal 5262 | . . . . 5 ⊢ (〈w, 0R〉 ∈ ℝ ↔ w ∈ R) | |
| 6 | 4, 5 | syl6ib 212 | . . . 4 ⊢ (A ⊆ ℝ → (w ∈ B → w ∈ R)) |
| 7 | 6 | ssrdv 2079 | . . 3 ⊢ (A ⊆ ℝ → B ⊆ R) |
| 8 | 7 | adantr 391 | . 2 ⊢ ((A ⊆ ℝ ⋀ ¬ A = ∅) → B ⊆ R) |
| 9 | ssel 2072 | . . . . . . . 8 ⊢ (A ⊆ ℝ → (x ∈ A → x ∈ ℝ)) | |
| 10 | 9 | com12 11 | . . . . . . 7 ⊢ (x ∈ A → (A ⊆ ℝ → x ∈ ℝ)) |
| 11 | eleq1 1541 | . . . . . . . . . . . . 13 ⊢ (〈w, 0R〉 = x → (〈w, 0R〉 ∈ A ↔ x ∈ A)) | |
| 12 | 11, 3 | syl5bb 535 | . . . . . . . . . . . 12 ⊢ (〈w, 0R〉 = x → (w ∈ B ↔ x ∈ A)) |
| 13 | 12 | biimprcd 156 | . . . . . . . . . . 11 ⊢ (x ∈ A → (〈w, 0R〉 = x → w ∈ B)) |
| 14 | n0i 2294 | . . . . . . . . . . 11 ⊢ (w ∈ B → ¬ B = ∅) | |
| 15 | 13, 14 | syl6 22 | . . . . . . . . . 10 ⊢ (x ∈ A → (〈w, 0R〉 = x → ¬ B = ∅)) |
| 16 | 15 | adantld 392 | . . . . . . . . 9 ⊢ (x ∈ A → ((w ∈ R ⋀ 〈w, 0R〉 = x) → ¬ B = ∅)) |
| 17 | 16 | 19.23adv 1220 | . . . . . . . 8 ⊢ (x ∈ A → (∃w(w ∈ R ⋀ 〈w, 0R〉 = x) → ¬ B = ∅)) |
| 18 | elreal 5263 | . . . . . . . 8 ⊢ (x ∈ ℝ ↔ ∃w(w ∈ R ⋀ 〈w, 0R〉 = x)) | |
| 19 | 17, 18 | syl5ib 206 | . . . . . . 7 ⊢ (x ∈ A → (x ∈ ℝ → ¬ B = ∅)) |
| 20 | 10, 19 | syld 27 | . . . . . 6 ⊢ (x ∈ A → (A ⊆ ℝ → ¬ B = ∅)) |
| 21 | 20 | 19.23aiv 1301 | . . . . 5 ⊢ (∃x x ∈ A → (A ⊆ ℝ → ¬ B = ∅)) |
| 22 | 21 | com12 11 | . . . 4 ⊢ (A ⊆ ℝ → (∃x x ∈ A → ¬ B = ∅)) |
| 23 | n0 2299 | . . . 4 ⊢ (¬ A = ∅ ↔ ∃x x ∈ A) | |
| 24 | 22, 23 | syl5ib 206 | . . 3 ⊢ (A ⊆ ℝ → (¬ A = ∅ → ¬ B = ∅)) |
| 25 | 24 | imp 350 | . 2 ⊢ ((A ⊆ ℝ ⋀ ¬ A = ∅) → ¬ B = ∅) |
| 26 | 8, 25 | jca 288 | 1 ⊢ ((A ⊆ ℝ ⋀ ¬ A = ∅) → (B ⊆ R ⋀ ¬ B = ∅)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 2 → wi 3 ⋀ wa 223 = wceq 960 ∈ wcel 962 ∃wex 984 {cab 1470 ⊆ wss 2056 ∅c0 2289 〈cop 2421 Rcnr 5006 0Rc0r 5007 ℝcr 5246 |
| This theorem is referenced by: supre 5273 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 966 ax-gen 967 ax-8 968 ax-9 969 ax-10 970 ax-11 971 ax-12 972 ax-13 973 ax-14 974 ax-17 975 ax-4 977 ax-5o 979 ax-6o 982 ax-9o 1129 ax-10o 1146 ax-16 1216 ax-11o 1224 ax-ext 1466 ax-rep 2706 ax-sep 2716 ax-nul 2723 ax-pow 2756 ax-pr 2793 ax-un 2880 ax-inf2 4637 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-3or 780 df-3an 781 df-ex 985 df-sb 1178 df-eu 1388 df-mo 1389 df-clab 1471 df-cleq 1476 df-clel 1479 df-ne 1594 df-ral 1656 df-rex 1657 df-reu 1658 df-rab 1659 df-v 1819 df-sbc 1949 df-csb 2010 df-dif 2058 df-un 2059 df-in 2060 df-ss 2062 df-pss 2064 df-nul 2290 df-if 2372 df-pw 2412 df-sn 2422 df-pr 2423 df-tp 2425 df-op 2426 df-uni 2516 df-int 2546 df-iun 2580 df-br 2633 df-opab 2680 df-tr 2694 df-eprel 2846 df-id 2849 df-po 2854 df-so 2864 df-fr 2931 df-we 2948 df-ord 2965 df-on 2966 df-lim 2967 df-suc 2968 df-om 3146 df-xp 3198 df-rel 3199 df-cnv 3200 df-co 3201 df-dm 3202 df-rn 3203 df-res 3204 df-ima 3205 df-fun 3206 df-fn 3207 df-f 3208 df-fv 3212 df-rdg 3946 df-opr 3979 df-oprab 3980 df-1st 4093 df-2nd 4094 df-1o 4147 df-oadd 4149 df-omul 4150 df-er 4275 df-ec 4277 df-qs 4280 df-ni 5013 df-pli 5014 df-mi 5015 df-lti 5016 df-plpq 5048 df-mpq 5049 df-enq 5050 df-nq 5051 df-plq 5052 df-mq 5053 df-rq 5054 df-ltq 5055 df-1q 5056 df-np 5099 df-1p 5100 df-enr 5179 df-nr 5180 df-0r 5184 df-r 5257 |