| 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 23419 | . 2 ⊢ (ordTop‘ ≤ ) = (topGen‘(fi‘(𝐴 ∪ 𝐵))) |
| 4 | letsr 18671 | . . . 4 ⊢ ≤ ∈ TosetRel | |
| 5 | ledm 18668 | . . . . 5 ⊢ ℝ* = dom ≤ | |
| 6 | 1 | leordtvallem1 23417 | . . . . 5 ⊢ 𝐴 = ran (𝑥 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ ¬ 𝑦 ≤ 𝑥}) |
| 7 | 1, 2 | leordtvallem2 23418 | . . . . 5 ⊢ 𝐵 = ran (𝑥 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ ¬ 𝑥 ≤ 𝑦}) |
| 8 | leordtval.3 | . . . . . 6 ⊢ 𝐶 = ran (,) | |
| 9 | df-ioo 13392 | . . . . . . . 8 ⊢ (,) = (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ (𝑎 < 𝑦 ∧ 𝑦 < 𝑏)}) | |
| 10 | xrltnle 11291 | . . . . . . . . . . . 12 ⊢ ((𝑎 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) → (𝑎 < 𝑦 ↔ ¬ 𝑦 ≤ 𝑎)) | |
| 11 | 10 | adantlr 728 | . . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ* ∧ 𝑏 ∈ ℝ*) ∧ 𝑦 ∈ ℝ*) → (𝑎 < 𝑦 ↔ ¬ 𝑦 ≤ 𝑎)) |
| 12 | xrltnle 11291 | . . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ ℝ* ∧ 𝑏 ∈ ℝ*) → (𝑦 < 𝑏 ↔ ¬ 𝑏 ≤ 𝑦)) | |
| 13 | 12 | ancoms 464 | . . . . . . . . . . . 12 ⊢ ((𝑏 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) → (𝑦 < 𝑏 ↔ ¬ 𝑏 ≤ 𝑦)) |
| 14 | 13 | adantll 727 | . . . . . . . . . . 11 ⊢ (((𝑎 ∈ ℝ* ∧ 𝑏 ∈ ℝ*) ∧ 𝑦 ∈ ℝ*) → (𝑦 < 𝑏 ↔ ¬ 𝑏 ≤ 𝑦)) |
| 15 | 11, 14 | anbi12d 644 | . . . . . . . . . 10 ⊢ (((𝑎 ∈ ℝ* ∧ 𝑏 ∈ ℝ*) ∧ 𝑦 ∈ ℝ*) → ((𝑎 < 𝑦 ∧ 𝑦 < 𝑏) ↔ (¬ 𝑦 ≤ 𝑎 ∧ ¬ 𝑏 ≤ 𝑦))) |
| 16 | 15 | rabbidva 3424 | . . . . . . . . 9 ⊢ ((𝑎 ∈ ℝ* ∧ 𝑏 ∈ ℝ*) → {𝑦 ∈ ℝ* ∣ (𝑎 < 𝑦 ∧ 𝑦 < 𝑏)} = {𝑦 ∈ ℝ* ∣ (¬ 𝑦 ≤ 𝑎 ∧ ¬ 𝑏 ≤ 𝑦)}) |
| 17 | 16 | mpoeq3ia 7497 | . . . . . . . 8 ⊢ (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ (𝑎 < 𝑦 ∧ 𝑦 < 𝑏)}) = (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ (¬ 𝑦 ≤ 𝑎 ∧ ¬ 𝑏 ≤ 𝑦)}) |
| 18 | 9, 17 | eqtri 2788 | . . . . . . 7 ⊢ (,) = (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ (¬ 𝑦 ≤ 𝑎 ∧ ¬ 𝑏 ≤ 𝑦)}) |
| 19 | 18 | rneqi 5929 | . . . . . 6 ⊢ ran (,) = ran (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ (¬ 𝑦 ≤ 𝑎 ∧ ¬ 𝑏 ≤ 𝑦)}) |
| 20 | 8, 19 | eqtri 2788 | . . . . 5 ⊢ 𝐶 = ran (𝑎 ∈ ℝ*, 𝑏 ∈ ℝ* ↦ {𝑦 ∈ ℝ* ∣ (¬ 𝑦 ≤ 𝑎 ∧ ¬ 𝑏 ≤ 𝑦)}) |
| 21 | 5, 6, 7, 20 | ordtbas2 23398 | . . . 4 ⊢ ( ≤ ∈ TosetRel → (fi‘(𝐴 ∪ 𝐵)) = ((𝐴 ∪ 𝐵) ∪ 𝐶)) |
| 22 | 4, 21 | ax-mp 5 | . . 3 ⊢ (fi‘(𝐴 ∪ 𝐵)) = ((𝐴 ∪ 𝐵) ∪ 𝐶) |
| 23 | 22 | fveq2i 6888 | . 2 ⊢ (topGen‘(fi‘(𝐴 ∪ 𝐵))) = (topGen‘((𝐴 ∪ 𝐵) ∪ 𝐶)) |
| 24 | 3, 23 | eqtri 2788 | 1 ⊢ (ordTop‘ ≤ ) = (topGen‘((𝐴 ∪ 𝐵) ∪ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 {crab 3418 ∪ cun 3904 class class class wbr 5111 ↦ cmpt 5194 ran crn 5664 ‘cfv 6540 (class class class)co 7419 ∈ cmpo 7421 ficfi 9377 +∞cpnf 11255 -∞cmnf 11256 ℝ*cxr 11257 < clt 11258 ≤ cle 11259 (,)cioo 13388 (,]cioc 13389 [,)cico 13390 topGenctg 17512 ordTopcordt 17575 TosetRel ctsr 18643 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-1o 8459 df-2o 8460 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-fi 9378 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-ioo 13392 df-ioc 13393 df-ico 13394 df-icc 13395 df-topgen 17518 df-ordt 17577 df-ps 18644 df-tsr 18645 df-top 23101 df-bases 23153 |
| This theorem is used by: iocpnfordt 23422 icomnfordt 23423 iooordt 23424 pnfnei 23427 mnfnei 23428 xrtgioo 25015 |
| Copyright terms: Public domain | W3C validator |