Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > bastop2 | GIF version |
Description: A version of bastop1 12723 that doesn't have 𝐵 ⊆ 𝐽 in the antecedent. (Contributed by NM, 3-Feb-2008.) |
Ref | Expression |
---|---|
bastop2 | ⊢ (𝐽 ∈ Top → ((topGen‘𝐵) = 𝐽 ↔ (𝐵 ⊆ 𝐽 ∧ ∀𝑥 ∈ 𝐽 ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1 2229 | . . . . . . . 8 ⊢ ((topGen‘𝐵) = 𝐽 → ((topGen‘𝐵) ∈ Top ↔ 𝐽 ∈ Top)) | |
2 | 1 | biimparc 297 | . . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐵) = 𝐽) → (topGen‘𝐵) ∈ Top) |
3 | tgclb 12705 | . . . . . . 7 ⊢ (𝐵 ∈ TopBases ↔ (topGen‘𝐵) ∈ Top) | |
4 | 2, 3 | sylibr 133 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐵) = 𝐽) → 𝐵 ∈ TopBases) |
5 | bastg 12701 | . . . . . 6 ⊢ (𝐵 ∈ TopBases → 𝐵 ⊆ (topGen‘𝐵)) | |
6 | 4, 5 | syl 14 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐵) = 𝐽) → 𝐵 ⊆ (topGen‘𝐵)) |
7 | simpr 109 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐵) = 𝐽) → (topGen‘𝐵) = 𝐽) | |
8 | 6, 7 | sseqtrd 3180 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐵) = 𝐽) → 𝐵 ⊆ 𝐽) |
9 | 8 | ex 114 | . . 3 ⊢ (𝐽 ∈ Top → ((topGen‘𝐵) = 𝐽 → 𝐵 ⊆ 𝐽)) |
10 | 9 | pm4.71rd 392 | . 2 ⊢ (𝐽 ∈ Top → ((topGen‘𝐵) = 𝐽 ↔ (𝐵 ⊆ 𝐽 ∧ (topGen‘𝐵) = 𝐽))) |
11 | bastop1 12723 | . . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ 𝐽) → ((topGen‘𝐵) = 𝐽 ↔ ∀𝑥 ∈ 𝐽 ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦))) | |
12 | 11 | pm5.32da 448 | . 2 ⊢ (𝐽 ∈ Top → ((𝐵 ⊆ 𝐽 ∧ (topGen‘𝐵) = 𝐽) ↔ (𝐵 ⊆ 𝐽 ∧ ∀𝑥 ∈ 𝐽 ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))) |
13 | 10, 12 | bitrd 187 | 1 ⊢ (𝐽 ∈ Top → ((topGen‘𝐵) = 𝐽 ↔ (𝐵 ⊆ 𝐽 ∧ ∀𝑥 ∈ 𝐽 ∃𝑦(𝑦 ⊆ 𝐵 ∧ 𝑥 = ∪ 𝑦)))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1343 ∃wex 1480 ∈ wcel 2136 ∀wral 2444 ⊆ wss 3116 ∪ cuni 3789 ‘cfv 5188 topGenctg 12571 Topctop 12635 TopBasesctb 12680 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 ax-un 4411 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 df-v 2728 df-sbc 2952 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-nul 3410 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-br 3983 df-opab 4044 df-mpt 4045 df-id 4271 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-iota 5153 df-fun 5190 df-fv 5196 df-topgen 12577 df-top 12636 df-bases 12681 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |