Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > eltg3 | GIF version |
Description: Membership in a topology generated by a basis. (Contributed by NM, 15-Jul-2006.) (Revised by Jim Kingdon, 4-Mar-2023.) |
Ref | Expression |
---|---|
eltg3 | ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ (topGen‘𝐵) ↔ ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-topgen 12600 | . . . . . . 7 ⊢ topGen = (𝑥 ∈ V ↦ {𝑦 ∣ 𝑦 ⊆ ∪ (𝑥 ∩ 𝒫 𝑦)}) | |
2 | 1 | funmpt2 5237 | . . . . . 6 ⊢ Fun topGen |
3 | funrel 5215 | . . . . . 6 ⊢ (Fun topGen → Rel topGen) | |
4 | 2, 3 | ax-mp 5 | . . . . 5 ⊢ Rel topGen |
5 | relelfvdm 5528 | . . . . 5 ⊢ ((Rel topGen ∧ 𝐴 ∈ (topGen‘𝐵)) → 𝐵 ∈ dom topGen) | |
6 | 4, 5 | mpan 422 | . . . 4 ⊢ (𝐴 ∈ (topGen‘𝐵) → 𝐵 ∈ dom topGen) |
7 | inex1g 4125 | . . . 4 ⊢ (𝐵 ∈ dom topGen → (𝐵 ∩ 𝒫 𝐴) ∈ V) | |
8 | 6, 7 | syl 14 | . . 3 ⊢ (𝐴 ∈ (topGen‘𝐵) → (𝐵 ∩ 𝒫 𝐴) ∈ V) |
9 | eltg4i 12849 | . . 3 ⊢ (𝐴 ∈ (topGen‘𝐵) → 𝐴 = ∪ (𝐵 ∩ 𝒫 𝐴)) | |
10 | inss1 3347 | . . . . . . 7 ⊢ (𝐵 ∩ 𝒫 𝐴) ⊆ 𝐵 | |
11 | sseq1 3170 | . . . . . . 7 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → (𝑥 ⊆ 𝐵 ↔ (𝐵 ∩ 𝒫 𝐴) ⊆ 𝐵)) | |
12 | 10, 11 | mpbiri 167 | . . . . . 6 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → 𝑥 ⊆ 𝐵) |
13 | 12 | biantrurd 303 | . . . . 5 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → (𝐴 = ∪ 𝑥 ↔ (𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥))) |
14 | unieq 3805 | . . . . . 6 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → ∪ 𝑥 = ∪ (𝐵 ∩ 𝒫 𝐴)) | |
15 | 14 | eqeq2d 2182 | . . . . 5 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → (𝐴 = ∪ 𝑥 ↔ 𝐴 = ∪ (𝐵 ∩ 𝒫 𝐴))) |
16 | 13, 15 | bitr3d 189 | . . . 4 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → ((𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥) ↔ 𝐴 = ∪ (𝐵 ∩ 𝒫 𝐴))) |
17 | 16 | spcegv 2818 | . . 3 ⊢ ((𝐵 ∩ 𝒫 𝐴) ∈ V → (𝐴 = ∪ (𝐵 ∩ 𝒫 𝐴) → ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥))) |
18 | 8, 9, 17 | sylc 62 | . 2 ⊢ (𝐴 ∈ (topGen‘𝐵) → ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥)) |
19 | eltg3i 12850 | . . . . 5 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑥 ⊆ 𝐵) → ∪ 𝑥 ∈ (topGen‘𝐵)) | |
20 | eleq1 2233 | . . . . 5 ⊢ (𝐴 = ∪ 𝑥 → (𝐴 ∈ (topGen‘𝐵) ↔ ∪ 𝑥 ∈ (topGen‘𝐵))) | |
21 | 19, 20 | syl5ibrcom 156 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑥 ⊆ 𝐵) → (𝐴 = ∪ 𝑥 → 𝐴 ∈ (topGen‘𝐵))) |
22 | 21 | expimpd 361 | . . 3 ⊢ (𝐵 ∈ 𝑉 → ((𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥) → 𝐴 ∈ (topGen‘𝐵))) |
23 | 22 | exlimdv 1812 | . 2 ⊢ (𝐵 ∈ 𝑉 → (∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥) → 𝐴 ∈ (topGen‘𝐵))) |
24 | 18, 23 | impbid2 142 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ (topGen‘𝐵) ↔ ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1348 ∃wex 1485 ∈ wcel 2141 {cab 2156 Vcvv 2730 ∩ cin 3120 ⊆ wss 3121 𝒫 cpw 3566 ∪ cuni 3796 dom cdm 4611 Rel wrel 4616 Fun wfun 5192 ‘cfv 5198 topGenctg 12594 |
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 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 ax-un 4418 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-rex 2454 df-v 2732 df-sbc 2956 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-br 3990 df-opab 4051 df-mpt 4052 df-id 4278 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-iota 5160 df-fun 5200 df-fv 5206 df-topgen 12600 |
This theorem is referenced by: tgval3 12852 tgtop 12862 eltop3 12865 tgidm 12868 bastop1 12877 tgrest 12963 tgcn 13002 txbasval 13061 |
Copyright terms: Public domain | W3C validator |