| 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 13404 | . . . . . . 7 ⊢ topGen = (𝑥 ∈ V ↦ {𝑦 ∣ 𝑦 ⊆ ∪ (𝑥 ∩ 𝒫 𝑦)}) | |
| 2 | 1 | funmpt2 5372 | . . . . . 6 ⊢ Fun topGen |
| 3 | funrel 5350 | . . . . . 6 ⊢ (Fun topGen → Rel topGen) | |
| 4 | 2, 3 | ax-mp 5 | . . . . 5 ⊢ Rel topGen |
| 5 | relelfvdm 5680 | . . . . 5 ⊢ ((Rel topGen ∧ 𝐴 ∈ (topGen‘𝐵)) → 𝐵 ∈ dom topGen) | |
| 6 | 4, 5 | mpan 424 | . . . 4 ⊢ (𝐴 ∈ (topGen‘𝐵) → 𝐵 ∈ dom topGen) |
| 7 | inex1g 4230 | . . . 4 ⊢ (𝐵 ∈ dom topGen → (𝐵 ∩ 𝒫 𝐴) ∈ V) | |
| 8 | 6, 7 | syl 14 | . . 3 ⊢ (𝐴 ∈ (topGen‘𝐵) → (𝐵 ∩ 𝒫 𝐴) ∈ V) |
| 9 | eltg4i 14846 | . . 3 ⊢ (𝐴 ∈ (topGen‘𝐵) → 𝐴 = ∪ (𝐵 ∩ 𝒫 𝐴)) | |
| 10 | inss1 3429 | . . . . . . 7 ⊢ (𝐵 ∩ 𝒫 𝐴) ⊆ 𝐵 | |
| 11 | sseq1 3251 | . . . . . . 7 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → (𝑥 ⊆ 𝐵 ↔ (𝐵 ∩ 𝒫 𝐴) ⊆ 𝐵)) | |
| 12 | 10, 11 | mpbiri 168 | . . . . . 6 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → 𝑥 ⊆ 𝐵) |
| 13 | 12 | biantrurd 305 | . . . . 5 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → (𝐴 = ∪ 𝑥 ↔ (𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥))) |
| 14 | unieq 3907 | . . . . . 6 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → ∪ 𝑥 = ∪ (𝐵 ∩ 𝒫 𝐴)) | |
| 15 | 14 | eqeq2d 2243 | . . . . 5 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → (𝐴 = ∪ 𝑥 ↔ 𝐴 = ∪ (𝐵 ∩ 𝒫 𝐴))) |
| 16 | 13, 15 | bitr3d 190 | . . . 4 ⊢ (𝑥 = (𝐵 ∩ 𝒫 𝐴) → ((𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥) ↔ 𝐴 = ∪ (𝐵 ∩ 𝒫 𝐴))) |
| 17 | 16 | spcegv 2895 | . . 3 ⊢ ((𝐵 ∩ 𝒫 𝐴) ∈ V → (𝐴 = ∪ (𝐵 ∩ 𝒫 𝐴) → ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥))) |
| 18 | 8, 9, 17 | sylc 62 | . 2 ⊢ (𝐴 ∈ (topGen‘𝐵) → ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥)) |
| 19 | eltg3i 14847 | . . . . 5 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑥 ⊆ 𝐵) → ∪ 𝑥 ∈ (topGen‘𝐵)) | |
| 20 | eleq1 2294 | . . . . 5 ⊢ (𝐴 = ∪ 𝑥 → (𝐴 ∈ (topGen‘𝐵) ↔ ∪ 𝑥 ∈ (topGen‘𝐵))) | |
| 21 | 19, 20 | syl5ibrcom 157 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑥 ⊆ 𝐵) → (𝐴 = ∪ 𝑥 → 𝐴 ∈ (topGen‘𝐵))) |
| 22 | 21 | expimpd 363 | . . 3 ⊢ (𝐵 ∈ 𝑉 → ((𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥) → 𝐴 ∈ (topGen‘𝐵))) |
| 23 | 22 | exlimdv 1867 | . 2 ⊢ (𝐵 ∈ 𝑉 → (∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥) → 𝐴 ∈ (topGen‘𝐵))) |
| 24 | 18, 23 | impbid2 143 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ (topGen‘𝐵) ↔ ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 = ∪ 𝑥))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∃wex 1541 ∈ wcel 2202 {cab 2217 Vcvv 2803 ∩ cin 3200 ⊆ wss 3201 𝒫 cpw 3656 ∪ cuni 3898 dom cdm 4731 Rel wrel 4736 Fun wfun 5327 ‘cfv 5333 topGenctg 13398 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-v 2805 df-sbc 3033 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-iota 5293 df-fun 5335 df-fv 5341 df-topgen 13404 |
| This theorem is referenced by: tgval3 14849 tgtop 14859 eltop3 14862 tgidm 14865 bastop1 14874 tgrest 14960 tgcn 14999 txbasval 15058 |
| Copyright terms: Public domain | W3C validator |