Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ordtcld2 | Structured version Visualization version GIF version |
Description: An upward ray [𝑃, +∞) is closed. (Contributed by Mario Carneiro, 3-Sep-2015.) |
Ref | Expression |
---|---|
ordttopon.3 | ⊢ 𝑋 = dom 𝑅 |
Ref | Expression |
---|---|
ordtcld2 | ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ∈ (Clsd‘(ordTop‘𝑅))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssrab2 4055 | . . 3 ⊢ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ⊆ 𝑋 | |
2 | ordttopon.3 | . . . . . 6 ⊢ 𝑋 = dom 𝑅 | |
3 | 2 | ordttopon 21795 | . . . . 5 ⊢ (𝑅 ∈ 𝑉 → (ordTop‘𝑅) ∈ (TopOn‘𝑋)) |
4 | 3 | adantr 483 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → (ordTop‘𝑅) ∈ (TopOn‘𝑋)) |
5 | toponuni 21516 | . . . 4 ⊢ ((ordTop‘𝑅) ∈ (TopOn‘𝑋) → 𝑋 = ∪ (ordTop‘𝑅)) | |
6 | 4, 5 | syl 17 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → 𝑋 = ∪ (ordTop‘𝑅)) |
7 | 1, 6 | sseqtrid 4018 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ⊆ ∪ (ordTop‘𝑅)) |
8 | notrab 4279 | . . . 4 ⊢ (𝑋 ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) = {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} | |
9 | 6 | difeq1d 4097 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → (𝑋 ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) = (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥})) |
10 | 8, 9 | syl5eqr 2870 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} = (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥})) |
11 | 2 | ordtopn2 21797 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} ∈ (ordTop‘𝑅)) |
12 | 10, 11 | eqeltrrd 2914 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) ∈ (ordTop‘𝑅)) |
13 | topontop 21515 | . . 3 ⊢ ((ordTop‘𝑅) ∈ (TopOn‘𝑋) → (ordTop‘𝑅) ∈ Top) | |
14 | eqid 2821 | . . . 4 ⊢ ∪ (ordTop‘𝑅) = ∪ (ordTop‘𝑅) | |
15 | 14 | iscld 21629 | . . 3 ⊢ ((ordTop‘𝑅) ∈ Top → ({𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ∈ (Clsd‘(ordTop‘𝑅)) ↔ ({𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ⊆ ∪ (ordTop‘𝑅) ∧ (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) ∈ (ordTop‘𝑅)))) |
16 | 4, 13, 15 | 3syl 18 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → ({𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ∈ (Clsd‘(ordTop‘𝑅)) ↔ ({𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ⊆ ∪ (ordTop‘𝑅) ∧ (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) ∈ (ordTop‘𝑅)))) |
17 | 7, 12, 16 | mpbir2and 711 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ∈ (Clsd‘(ordTop‘𝑅))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 {crab 3142 ∖ cdif 3932 ⊆ wss 3935 ∪ cuni 4831 class class class wbr 5058 dom cdm 5549 ‘cfv 6349 ordTopcordt 16766 Topctop 21495 TopOnctopon 21512 Clsdccld 21618 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-oadd 8100 df-er 8283 df-en 8504 df-fin 8507 df-fi 8869 df-topgen 16711 df-ordt 16768 df-top 21496 df-topon 21513 df-bases 21548 df-cld 21621 |
This theorem is referenced by: ordtcld3 21801 |
Copyright terms: Public domain | W3C validator |