![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > isbasisg | GIF version |
Description: Express the predicate "the set 𝐵 is a basis for a topology". (Contributed by NM, 17-Jul-2006.) |
Ref | Expression |
---|---|
isbasisg | ⊢ (𝐵 ∈ 𝐶 → (𝐵 ∈ TopBases ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ineq1 3275 | . . . . . 6 ⊢ (𝑧 = 𝐵 → (𝑧 ∩ 𝒫 (𝑥 ∩ 𝑦)) = (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦))) | |
2 | 1 | unieqd 3755 | . . . . 5 ⊢ (𝑧 = 𝐵 → ∪ (𝑧 ∩ 𝒫 (𝑥 ∩ 𝑦)) = ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦))) |
3 | 2 | sseq2d 3132 | . . . 4 ⊢ (𝑧 = 𝐵 → ((𝑥 ∩ 𝑦) ⊆ ∪ (𝑧 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))) |
4 | 3 | raleqbi1dv 2637 | . . 3 ⊢ (𝑧 = 𝐵 → (∀𝑦 ∈ 𝑧 (𝑥 ∩ 𝑦) ⊆ ∪ (𝑧 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))) |
5 | 4 | raleqbi1dv 2637 | . 2 ⊢ (𝑧 = 𝐵 → (∀𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 (𝑥 ∩ 𝑦) ⊆ ∪ (𝑧 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))) |
6 | df-bases 12249 | . 2 ⊢ TopBases = {𝑧 ∣ ∀𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 (𝑥 ∩ 𝑦) ⊆ ∪ (𝑧 ∩ 𝒫 (𝑥 ∩ 𝑦))} | |
7 | 5, 6 | elab2g 2835 | 1 ⊢ (𝐵 ∈ 𝐶 → (𝐵 ∈ TopBases ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ∩ 𝑦) ⊆ ∪ (𝐵 ∩ 𝒫 (𝑥 ∩ 𝑦)))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 = wceq 1332 ∈ wcel 1481 ∀wral 2417 ∩ cin 3075 ⊆ wss 3076 𝒫 cpw 3515 ∪ cuni 3744 TopBasesctb 12248 |
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-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ral 2422 df-rex 2423 df-v 2691 df-in 3082 df-ss 3089 df-uni 3745 df-bases 12249 |
This theorem is referenced by: isbasis2g 12251 basis1 12253 baspartn 12256 |
Copyright terms: Public domain | W3C validator |