![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ipotset | Structured version Visualization version GIF version |
Description: Topology of the inclusion poset. (Contributed by Mario Carneiro, 24-Oct-2015.) |
Ref | Expression |
---|---|
ipoval.i | ⊢ 𝐼 = (toInc‘𝐹) |
ipole.l | ⊢ ≤ = (le‘𝐼) |
Ref | Expression |
---|---|
ipotset | ⊢ (𝐹 ∈ 𝑉 → (ordTop‘ ≤ ) = (TopSet‘𝐼)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvex 6891 | . . 3 ⊢ (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}) ∈ V | |
2 | ipostr 18464 | . . . 4 ⊢ ({〈(Base‘ndx), 𝐹〉, 〈(TopSet‘ndx), (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)})〉} ∪ {〈(le‘ndx), {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}〉, 〈(oc‘ndx), (𝑥 ∈ 𝐹 ↦ ∪ {𝑦 ∈ 𝐹 ∣ (𝑦 ∩ 𝑥) = ∅})〉}) Struct 〈1, ;11〉 | |
3 | tsetid 17280 | . . . 4 ⊢ TopSet = Slot (TopSet‘ndx) | |
4 | snsspr2 4811 | . . . . 5 ⊢ {〈(TopSet‘ndx), (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)})〉} ⊆ {〈(Base‘ndx), 𝐹〉, 〈(TopSet‘ndx), (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)})〉} | |
5 | ssun1 4168 | . . . . 5 ⊢ {〈(Base‘ndx), 𝐹〉, 〈(TopSet‘ndx), (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)})〉} ⊆ ({〈(Base‘ndx), 𝐹〉, 〈(TopSet‘ndx), (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)})〉} ∪ {〈(le‘ndx), {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}〉, 〈(oc‘ndx), (𝑥 ∈ 𝐹 ↦ ∪ {𝑦 ∈ 𝐹 ∣ (𝑦 ∩ 𝑥) = ∅})〉}) | |
6 | 4, 5 | sstri 3987 | . . . 4 ⊢ {〈(TopSet‘ndx), (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)})〉} ⊆ ({〈(Base‘ndx), 𝐹〉, 〈(TopSet‘ndx), (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)})〉} ∪ {〈(le‘ndx), {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}〉, 〈(oc‘ndx), (𝑥 ∈ 𝐹 ↦ ∪ {𝑦 ∈ 𝐹 ∣ (𝑦 ∩ 𝑥) = ∅})〉}) |
7 | 2, 3, 6 | strfv 17119 | . . 3 ⊢ ((ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}) ∈ V → (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}) = (TopSet‘({〈(Base‘ndx), 𝐹〉, 〈(TopSet‘ndx), (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)})〉} ∪ {〈(le‘ndx), {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}〉, 〈(oc‘ndx), (𝑥 ∈ 𝐹 ↦ ∪ {𝑦 ∈ 𝐹 ∣ (𝑦 ∩ 𝑥) = ∅})〉}))) |
8 | 1, 7 | ax-mp 5 | . 2 ⊢ (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}) = (TopSet‘({〈(Base‘ndx), 𝐹〉, 〈(TopSet‘ndx), (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)})〉} ∪ {〈(le‘ndx), {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}〉, 〈(oc‘ndx), (𝑥 ∈ 𝐹 ↦ ∪ {𝑦 ∈ 𝐹 ∣ (𝑦 ∩ 𝑥) = ∅})〉})) |
9 | ipole.l | . . . 4 ⊢ ≤ = (le‘𝐼) | |
10 | ipoval.i | . . . . 5 ⊢ 𝐼 = (toInc‘𝐹) | |
11 | 10 | ipolerval 18467 | . . . 4 ⊢ (𝐹 ∈ 𝑉 → {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)} = (le‘𝐼)) |
12 | 9, 11 | eqtr4id 2790 | . . 3 ⊢ (𝐹 ∈ 𝑉 → ≤ = {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}) |
13 | 12 | fveq2d 6882 | . 2 ⊢ (𝐹 ∈ 𝑉 → (ordTop‘ ≤ ) = (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)})) |
14 | eqid 2731 | . . . 4 ⊢ {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)} = {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)} | |
15 | 10, 14 | ipoval 18465 | . . 3 ⊢ (𝐹 ∈ 𝑉 → 𝐼 = ({〈(Base‘ndx), 𝐹〉, 〈(TopSet‘ndx), (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)})〉} ∪ {〈(le‘ndx), {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}〉, 〈(oc‘ndx), (𝑥 ∈ 𝐹 ↦ ∪ {𝑦 ∈ 𝐹 ∣ (𝑦 ∩ 𝑥) = ∅})〉})) |
16 | 15 | fveq2d 6882 | . 2 ⊢ (𝐹 ∈ 𝑉 → (TopSet‘𝐼) = (TopSet‘({〈(Base‘ndx), 𝐹〉, 〈(TopSet‘ndx), (ordTop‘{〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)})〉} ∪ {〈(le‘ndx), {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐹 ∧ 𝑥 ⊆ 𝑦)}〉, 〈(oc‘ndx), (𝑥 ∈ 𝐹 ↦ ∪ {𝑦 ∈ 𝐹 ∣ (𝑦 ∩ 𝑥) = ∅})〉}))) |
17 | 8, 13, 16 | 3eqtr4a 2797 | 1 ⊢ (𝐹 ∈ 𝑉 → (ordTop‘ ≤ ) = (TopSet‘𝐼)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 {crab 3431 Vcvv 3473 ∪ cun 3942 ∩ cin 3943 ⊆ wss 3944 ∅c0 4318 {csn 4622 {cpr 4624 〈cop 4628 ∪ cuni 4901 {copab 5203 ↦ cmpt 5224 ‘cfv 6532 1c1 11093 ;cdc 12659 ndxcnx 17108 Basecbs 17126 TopSetcts 17185 lecple 17186 occoc 17187 ordTopcordt 17427 toInccipo 18462 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 ax-cnex 11148 ax-resscn 11149 ax-1cn 11150 ax-icn 11151 ax-addcl 11152 ax-addrcl 11153 ax-mulcl 11154 ax-mulrcl 11155 ax-mulcom 11156 ax-addass 11157 ax-mulass 11158 ax-distr 11159 ax-i2m1 11160 ax-1ne0 11161 ax-1rid 11162 ax-rnegex 11163 ax-rrecex 11164 ax-cnre 11165 ax-pre-lttri 11166 ax-pre-lttrn 11167 ax-pre-ltadd 11168 ax-pre-mulgt0 11169 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-op 4629 df-uni 4902 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6289 df-ord 6356 df-on 6357 df-lim 6358 df-suc 6359 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-f1 6537 df-fo 6538 df-f1o 6539 df-fv 6540 df-riota 7349 df-ov 7396 df-oprab 7397 df-mpo 7398 df-om 7839 df-1st 7957 df-2nd 7958 df-frecs 8248 df-wrecs 8279 df-recs 8353 df-rdg 8392 df-1o 8448 df-er 8686 df-en 8923 df-dom 8924 df-sdom 8925 df-fin 8926 df-pnf 11232 df-mnf 11233 df-xr 11234 df-ltxr 11235 df-le 11236 df-sub 11428 df-neg 11429 df-nn 12195 df-2 12257 df-3 12258 df-4 12259 df-5 12260 df-6 12261 df-7 12262 df-8 12263 df-9 12264 df-n0 12455 df-z 12541 df-dec 12660 df-uz 12805 df-fz 13467 df-struct 17062 df-slot 17097 df-ndx 17109 df-base 17127 df-tset 17198 df-ple 17199 df-ocomp 17200 df-ipo 18463 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |