| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > leordtval | Structured version Visualization version GIF version | ||
| Description: The topology of the extended reals. (Contributed by Mario Carneiro, 3-Sep-2015.) |
| Ref | Expression |
|---|---|
| leordtval.1 | ⊢ 𝐴 = ran (𝑥 ∈ ℝ* ↦ (𝑥(,]+∞)) |
| leordtval.2 | ⊢ 𝐵 = ran (𝑥 ∈ ℝ* ↦ (-∞[,)𝑥)) |
| leordtval.3 | ⊢ 𝐶 = ran (,) |
| Ref | Expression |
|---|---|
| leordtval | ⊢ (ordTop‘ ≤ ) = (topGen‘((𝐴 ∪ 𝐵) ∪ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | leordtval.1 | . . 3 ⊢ 𝐴 = ran (𝑥 ∈ ℝ* ↦ (𝑥(,]+∞)) | |
| 2 | leordtval.2 | . . 3 ⊢ 𝐵 = ran (𝑥 ∈ ℝ* ↦ (-∞[,)𝑥)) | |
| 3 | 1, 2 | leordtval2 23177 | . 2 ⊢ (ordTop‘ ≤ ) = (topGen‘(fi‘(𝐴 ∪ 𝐵))) |
| 4 | letsr 18559 | . . . 4 ⊢ ≤ ∈ TosetRel | |
| 5 | ledm 18556 | . . . . 5 ⊢ ℝ* = dom ≤ | |
| 6 | 1 | leordtvallem1 23175 | . . . . 5 ⊢ 𝐴 = ran (𝑥 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ ¬ 𝑦 ≤ 𝑥}) |
| 7 | 1, 2 | leordtvallem2 23176 | . . . . 5 ⊢ 𝐵 = ran (𝑥 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ ¬ 𝑥 ≤ 𝑦}) |
| 8 | leordtval.3 | . . . . . 6 ⊢ 𝐶 = ran (,) | |
| 9 | df-ioo 13302 | . . . . . . . 8 ⊢ (,) = (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ (𝑎 < 𝑦 ∧ 𝑦 < 𝑏)}) | |
| 10 | xrltnle 11212 | . . . . . . . . . . . 12 ⊢ ((𝑎 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) → (𝑎 < 𝑦 ↔ ¬ 𝑦 ≤ 𝑎)) | |
| 11 | 10 | adantlr 716 | . . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ* ∧ 𝑏 ∈ ℝ*) ∧ 𝑦 ∈ ℝ*) → (𝑎 < 𝑦 ↔ ¬ 𝑦 ≤ 𝑎)) |
| 12 | xrltnle 11212 | . . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ ℝ* ∧ 𝑏 ∈ ℝ*) → (𝑦 < 𝑏 ↔ ¬ 𝑏 ≤ 𝑦)) | |
| 13 | 12 | ancoms 458 | . . . . . . . . . . . 12 ⊢ ((𝑏 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) → (𝑦 < 𝑏 ↔ ¬ 𝑏 ≤ 𝑦)) |
| 14 | 13 | adantll 715 | . . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ* ∧ 𝑏 ∈ ℝ*) ∧ 𝑦 ∈ ℝ*) → (𝑦 < 𝑏 ↔ ¬ 𝑏 ≤ 𝑦)) |
| 15 | 11, 14 | anbi12d 633 | . . . . . . . . . 10 ⊢ (((𝑎 ∈ ℝ* ∧ 𝑏 ∈ ℝ*) ∧ 𝑦 ∈ ℝ*) → ((𝑎 < 𝑦 ∧ 𝑦 < 𝑏) ↔ (¬ 𝑦 ≤ 𝑎 ∧ ¬ 𝑏 ≤ 𝑦))) |
| 16 | 15 | rabbidva 3395 | . . . . . . . . 9 ⊢ ((𝑎 ∈ ℝ* ∧ 𝑏 ∈ ℝ*) → {𝑦 ∈ ℝ* ∣ (𝑎 < 𝑦 ∧ 𝑦 < 𝑏)} = {𝑦 ∈ ℝ* ∣ (¬ 𝑦 ≤ 𝑎 ∧ ¬ 𝑏 ≤ 𝑦)}) |
| 17 | 16 | mpoeq3ia 7445 | . . . . . . . 8 ⊢ (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ (𝑎 < 𝑦 ∧ 𝑦 < 𝑏)}) = (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ (¬ 𝑦 ≤ 𝑎 ∧ ¬ 𝑏 ≤ 𝑦)}) |
| 18 | 9, 17 | eqtri 2759 | . . . . . . 7 ⊢ (,) = (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ (¬ 𝑦 ≤ 𝑎 ∧ ¬ 𝑏 ≤ 𝑦)}) |
| 19 | 18 | rneqi 5892 | . . . . . 6 ⊢ ran (,) = ran (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ (¬ 𝑦 ≤ 𝑎 ∧ ¬ 𝑏 ≤ 𝑦)}) |
| 20 | 8, 19 | eqtri 2759 | . . . . 5 ⊢ 𝐶 = ran (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ (¬ 𝑦 ≤ 𝑎 ∧ ¬ 𝑏 ≤ 𝑦)}) |
| 21 | 5, 6, 7, 20 | ordtbas2 23156 | . . . 4 ⊢ ( ≤ ∈ TosetRel → (fi‘(𝐴 ∪ 𝐵)) = ((𝐴 ∪ 𝐵) ∪ 𝐶)) |
| 22 | 4, 21 | ax-mp 5 | . . 3 ⊢ (fi‘(𝐴 ∪ 𝐵)) = ((𝐴 ∪ 𝐵) ∪ 𝐶) |
| 23 | 22 | fveq2i 6843 | . 2 ⊢ (topGen‘(fi‘(𝐴 ∪ 𝐵))) = (topGen‘((𝐴 ∪ 𝐵) ∪ 𝐶)) |
| 24 | 3, 23 | eqtri 2759 | 1 ⊢ (ordTop‘ ≤ ) = (topGen‘((𝐴 ∪ 𝐵) ∪ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3389 ∪ cun 3887 class class class wbr 5085 ↦ cmpt 5166 ran crn 5632 ‘cfv 6498 (class class class)co 7367 ∈ cmpo 7369 ficfi 9323 +∞cpnf 11176 -∞cmnf 11177 ℝ*cxr 11178 < clt 11179 ≤ cle 11180 (,)cioo 13298 (,]cioc 13299 [,)cico 13300 topGenctg 17400 ordTopcordt 17463 TosetRel ctsr 18531 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-1o 8405 df-2o 8406 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-fi 9324 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-ioo 13302 df-ioc 13303 df-ico 13304 df-icc 13305 df-topgen 17406 df-ordt 17465 df-ps 18532 df-tsr 18533 df-top 22859 df-bases 22911 |
| This theorem is referenced by: iocpnfordt 23180 icomnfordt 23181 iooordt 23182 pnfnei 23185 mnfnei 23186 xrtgioo 24772 |
| Copyright terms: Public domain | W3C validator |