![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cnvordtrestixx | Structured version Visualization version GIF version |
Description: The restriction of the 'greater than' order to an interval gives the same topology as the subspace topology. (Contributed by Thierry Arnoux, 1-Apr-2017.) |
Ref | Expression |
---|---|
cnvordtrestixx.1 | ⊢ 𝐴 ⊆ ℝ* |
cnvordtrestixx.2 | ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥[,]𝑦) ⊆ 𝐴) |
Ref | Expression |
---|---|
cnvordtrestixx | ⊢ ((ordTop‘ ≤ ) ↾t 𝐴) = (ordTop‘(◡ ≤ ∩ (𝐴 × 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lern 17827 | . . . . 5 ⊢ ℝ* = ran ≤ | |
2 | df-rn 5530 | . . . . 5 ⊢ ran ≤ = dom ◡ ≤ | |
3 | 1, 2 | eqtri 2821 | . . . 4 ⊢ ℝ* = dom ◡ ≤ |
4 | letsr 17829 | . . . . . 6 ⊢ ≤ ∈ TosetRel | |
5 | cnvtsr 17824 | . . . . . 6 ⊢ ( ≤ ∈ TosetRel → ◡ ≤ ∈ TosetRel ) | |
6 | 4, 5 | ax-mp 5 | . . . . 5 ⊢ ◡ ≤ ∈ TosetRel |
7 | 6 | a1i 11 | . . . 4 ⊢ (⊤ → ◡ ≤ ∈ TosetRel ) |
8 | cnvordtrestixx.1 | . . . . 5 ⊢ 𝐴 ⊆ ℝ* | |
9 | 8 | a1i 11 | . . . 4 ⊢ (⊤ → 𝐴 ⊆ ℝ*) |
10 | brcnvg 5714 | . . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ ℝ*) → (𝑦◡ ≤ 𝑧 ↔ 𝑧 ≤ 𝑦)) | |
11 | 10 | adantlr 714 | . . . . . . . . 9 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑧 ∈ ℝ*) → (𝑦◡ ≤ 𝑧 ↔ 𝑧 ≤ 𝑦)) |
12 | simpr 488 | . . . . . . . . . 10 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑧 ∈ ℝ*) → 𝑧 ∈ ℝ*) | |
13 | simplr 768 | . . . . . . . . . 10 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑧 ∈ ℝ*) → 𝑥 ∈ 𝐴) | |
14 | brcnvg 5714 | . . . . . . . . . 10 ⊢ ((𝑧 ∈ ℝ* ∧ 𝑥 ∈ 𝐴) → (𝑧◡ ≤ 𝑥 ↔ 𝑥 ≤ 𝑧)) | |
15 | 12, 13, 14 | syl2anc 587 | . . . . . . . . 9 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑧 ∈ ℝ*) → (𝑧◡ ≤ 𝑥 ↔ 𝑥 ≤ 𝑧)) |
16 | 11, 15 | anbi12d 633 | . . . . . . . 8 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑧 ∈ ℝ*) → ((𝑦◡ ≤ 𝑧 ∧ 𝑧◡ ≤ 𝑥) ↔ (𝑧 ≤ 𝑦 ∧ 𝑥 ≤ 𝑧))) |
17 | ancom 464 | . . . . . . . 8 ⊢ ((𝑧 ≤ 𝑦 ∧ 𝑥 ≤ 𝑧) ↔ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)) | |
18 | 16, 17 | syl6bb 290 | . . . . . . 7 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑧 ∈ ℝ*) → ((𝑦◡ ≤ 𝑧 ∧ 𝑧◡ ≤ 𝑥) ↔ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦))) |
19 | 18 | rabbidva 3425 | . . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → {𝑧 ∈ ℝ* ∣ (𝑦◡ ≤ 𝑧 ∧ 𝑧◡ ≤ 𝑥)} = {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)}) |
20 | simpr 488 | . . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
21 | 8, 20 | sseldi 3913 | . . . . . . . 8 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ*) |
22 | simpl 486 | . . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ 𝐴) | |
23 | 8, 22 | sseldi 3913 | . . . . . . . 8 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ ℝ*) |
24 | iccval 12765 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) → (𝑥[,]𝑦) = {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)}) | |
25 | 21, 23, 24 | syl2anc 587 | . . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑥[,]𝑦) = {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)}) |
26 | cnvordtrestixx.2 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥[,]𝑦) ⊆ 𝐴) | |
27 | 26 | ancoms 462 | . . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑥[,]𝑦) ⊆ 𝐴) |
28 | 25, 27 | eqsstrrd 3954 | . . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → {𝑧 ∈ ℝ* ∣ (𝑥 ≤ 𝑧 ∧ 𝑧 ≤ 𝑦)} ⊆ 𝐴) |
29 | 19, 28 | eqsstrd 3953 | . . . . 5 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → {𝑧 ∈ ℝ* ∣ (𝑦◡ ≤ 𝑧 ∧ 𝑧◡ ≤ 𝑥)} ⊆ 𝐴) |
30 | 29 | adantl 485 | . . . 4 ⊢ ((⊤ ∧ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴)) → {𝑧 ∈ ℝ* ∣ (𝑦◡ ≤ 𝑧 ∧ 𝑧◡ ≤ 𝑥)} ⊆ 𝐴) |
31 | 3, 7, 9, 30 | ordtrest2 21809 | . . 3 ⊢ (⊤ → (ordTop‘(◡ ≤ ∩ (𝐴 × 𝐴))) = ((ordTop‘◡ ≤ ) ↾t 𝐴)) |
32 | 31 | mptru 1545 | . 2 ⊢ (ordTop‘(◡ ≤ ∩ (𝐴 × 𝐴))) = ((ordTop‘◡ ≤ ) ↾t 𝐴) |
33 | tsrps 17823 | . . . . 5 ⊢ ( ≤ ∈ TosetRel → ≤ ∈ PosetRel) | |
34 | 4, 33 | ax-mp 5 | . . . 4 ⊢ ≤ ∈ PosetRel |
35 | ordtcnv 21806 | . . . 4 ⊢ ( ≤ ∈ PosetRel → (ordTop‘◡ ≤ ) = (ordTop‘ ≤ )) | |
36 | 34, 35 | ax-mp 5 | . . 3 ⊢ (ordTop‘◡ ≤ ) = (ordTop‘ ≤ ) |
37 | 36 | oveq1i 7145 | . 2 ⊢ ((ordTop‘◡ ≤ ) ↾t 𝐴) = ((ordTop‘ ≤ ) ↾t 𝐴) |
38 | 32, 37 | eqtr2i 2822 | 1 ⊢ ((ordTop‘ ≤ ) ↾t 𝐴) = (ordTop‘(◡ ≤ ∩ (𝐴 × 𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ⊤wtru 1539 ∈ wcel 2111 {crab 3110 ∩ cin 3880 ⊆ wss 3881 class class class wbr 5030 × cxp 5517 ◡ccnv 5518 dom cdm 5519 ran crn 5520 ‘cfv 6324 (class class class)co 7135 ℝ*cxr 10663 ≤ cle 10665 [,]cicc 12729 ↾t crest 16686 ordTopcordt 16764 PosetRelcps 17800 TosetRel ctsr 17801 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-pre-lttri 10600 ax-pre-lttrn 10601 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-iin 4884 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-fi 8859 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-icc 12733 df-rest 16688 df-topgen 16709 df-ordt 16766 df-ps 17802 df-tsr 17803 df-top 21499 df-topon 21516 df-bases 21551 |
This theorem is referenced by: xrge0iifhmeo 31289 |
Copyright terms: Public domain | W3C validator |