| 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 4032 | . . 3 ⊢ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ⊆ 𝑋 | |
| 2 | ordttopon.3 | . . . . . 6 ⊢ 𝑋 = dom 𝑅 | |
| 3 | 2 | ordttopon 23137 | . . . . 5 ⊢ (𝑅 ∈ 𝑉 → (ordTop‘𝑅) ∈ (TopOn‘𝑋)) |
| 4 | 3 | adantr 480 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → (ordTop‘𝑅) ∈ (TopOn‘𝑋)) |
| 5 | toponuni 22858 | . . . 4 ⊢ ((ordTop‘𝑅) ∈ (TopOn‘𝑋) → 𝑋 = ∪ (ordTop‘𝑅)) | |
| 6 | 4, 5 | syl 17 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → 𝑋 = ∪ (ordTop‘𝑅)) |
| 7 | 1, 6 | sseqtrid 3976 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ⊆ ∪ (ordTop‘𝑅)) |
| 8 | notrab 4274 | . . . 4 ⊢ (𝑋 ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) = {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} | |
| 9 | 6 | difeq1d 4077 | . . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → (𝑋 ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) = (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥})) |
| 10 | 8, 9 | eqtr3id 2785 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} = (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥})) |
| 11 | 2 | ordtopn2 23139 | . . 3 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ ¬ 𝑃𝑅𝑥} ∈ (ordTop‘𝑅)) |
| 12 | 10, 11 | eqeltrrd 2837 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → (∪ (ordTop‘𝑅) ∖ {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥}) ∈ (ordTop‘𝑅)) |
| 13 | topontop 22857 | . . 3 ⊢ ((ordTop‘𝑅) ∈ (TopOn‘𝑋) → (ordTop‘𝑅) ∈ Top) | |
| 14 | eqid 2736 | . . . 4 ⊢ ∪ (ordTop‘𝑅) = ∪ (ordTop‘𝑅) | |
| 15 | 14 | iscld 22971 | . . 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 713 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑃 ∈ 𝑋) → {𝑥 ∈ 𝑋 ∣ 𝑃𝑅𝑥} ∈ (Clsd‘(ordTop‘𝑅))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 {crab 3399 ∖ cdif 3898 ⊆ wss 3901 ∪ cuni 4863 class class class wbr 5098 dom cdm 5624 ‘cfv 6492 ordTopcordt 17420 Topctop 22837 TopOnctopon 22854 Clsdccld 22960 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-om 7809 df-1o 8397 df-2o 8398 df-en 8884 df-fin 8887 df-fi 9314 df-topgen 17363 df-ordt 17422 df-top 22838 df-topon 22855 df-bases 22890 df-cld 22963 |
| This theorem is referenced by: ordtcld3 23143 |
| Copyright terms: Public domain | W3C validator |