| 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 4028 | . . 3 ⊢ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ⊆ 𝑋 | |
| 2 | ordttopon.3 | . . . . . 6 ⊢ 𝑋 = dom 𝑅 | |
| 3 | 2 | ordttopon 23511 | . . . . 5 ⊢ (𝑅 ∈ 𝑉 → (ordTop‘𝑅) ∈ (TopOn‘𝑋)) |
| 4 | 3 | adantr 486 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → (ordTop‘𝑅) ∈ (TopOn‘𝑋)) |
| 5 | toponuni 23232 | . . . 4 ⊢ ((ordTop‘𝑅) ∈ (TopOn‘𝑋) → 𝑋 = ∪ (ordTop‘𝑅)) | |
| 6 | 4, 5 | syl 18 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → 𝑋 = ∪ (ordTop‘𝑅)) |
| 7 | 1, 6 | sseqtrid 3973 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ⊆ ∪ (ordTop‘𝑅)) |
| 8 | notrab 4268 | . . . 4 ⊢ (𝑋 ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) = {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} | |
| 9 | 6 | difeq1d 4073 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → (𝑋 ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) = (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥})) |
| 10 | 8, 9 | eqtr3id 2810 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} = (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥})) |
| 11 | 2 | ordtopn2 23513 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} ∈ (ordTop‘𝑅)) |
| 12 | 10, 11 | eqeltrrd 2862 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) ∈ (ordTop‘𝑅)) |
| 13 | topontop 23231 | . . 3 ⊢ ((ordTop‘𝑅) ∈ (TopOn‘𝑋) → (ordTop‘𝑅) ∈ Top) | |
| 14 | eqid 2761 | . . . 4 ⊢ ∪ (ordTop‘𝑅) = ∪ (ordTop‘𝑅) | |
| 15 | 14 | iscld 23345 | . . 3 ⊢ ((ordTop‘𝑅) ∈ Top → ({𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ∈ (Clsd‘(ordTop‘𝑅)) ↔ ({𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ⊆ ∪ (ordTop‘𝑅) ∧ (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) ∈ (ordTop‘𝑅)))) |
| 16 | 4, 13, 15 | 3syl 19 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → ({𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ∈ (Clsd‘(ordTop‘𝑅)) ↔ ({𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ⊆ ∪ (ordTop‘𝑅) ∧ (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) ∈ (ordTop‘𝑅)))) |
| 17 | 7, 12, 16 | mpbir2and 726 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ∈ (Clsd‘(ordTop‘𝑅))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {crab 3413 ∖ cdif 3896 ⊆ wss 3899 ∪ cuni 4867 class class class wbr 5103 dom cdm 5651 ‘cfv 6538 ordTopcordt 17671 Topctop 23211 TopOnctopon 23228 Clsdccld 23334 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-om 7878 df-1o 8476 df-2o 8477 df-en 8974 df-fin 8977 df-fi 9403 df-topgen 17614 df-ordt 17673 df-top 23212 df-topon 23229 df-bases 23264 df-cld 23337 |
| This theorem is used by: ordtcld3 23517 |
| Copyright terms: Public domain | W3C validator |