Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elfg | Structured version Visualization version GIF version |
Description: A condition for elements of a generated filter. (Contributed by Jeff Hankins, 3-Sep-2009.) (Revised by Stefan O'Rear, 2-Aug-2015.) |
Ref | Expression |
---|---|
elfg | ⊢ (𝐹 ∈ (fBas‘𝑋) → (𝐴 ∈ (𝑋filGen𝐹) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐹 𝑥 ⊆ 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fgval 21484 | . . 3 ⊢ (𝐹 ∈ (fBas‘𝑋) → (𝑋filGen𝐹) = {𝑦 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑦) ≠ ∅}) | |
2 | 1 | eleq2d 2673 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → (𝐴 ∈ (𝑋filGen𝐹) ↔ 𝐴 ∈ {𝑦 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑦) ≠ ∅})) |
3 | pweq 4111 | . . . . . 6 ⊢ (𝑦 = 𝐴 → 𝒫 𝑦 = 𝒫 𝐴) | |
4 | 3 | ineq2d 3776 | . . . . 5 ⊢ (𝑦 = 𝐴 → (𝐹 ∩ 𝒫 𝑦) = (𝐹 ∩ 𝒫 𝐴)) |
5 | 4 | neeq1d 2841 | . . . 4 ⊢ (𝑦 = 𝐴 → ((𝐹 ∩ 𝒫 𝑦) ≠ ∅ ↔ (𝐹 ∩ 𝒫 𝐴) ≠ ∅)) |
6 | 5 | elrab 3331 | . . 3 ⊢ (𝐴 ∈ {𝑦 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑦) ≠ ∅} ↔ (𝐴 ∈ 𝒫 𝑋 ∧ (𝐹 ∩ 𝒫 𝐴) ≠ ∅)) |
7 | elfvdm 6130 | . . . . 5 ⊢ (𝐹 ∈ (fBas‘𝑋) → 𝑋 ∈ dom fBas) | |
8 | elpw2g 4754 | . . . . 5 ⊢ (𝑋 ∈ dom fBas → (𝐴 ∈ 𝒫 𝑋 ↔ 𝐴 ⊆ 𝑋)) | |
9 | 7, 8 | syl 17 | . . . 4 ⊢ (𝐹 ∈ (fBas‘𝑋) → (𝐴 ∈ 𝒫 𝑋 ↔ 𝐴 ⊆ 𝑋)) |
10 | elin 3758 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝐹 ∩ 𝒫 𝐴) ↔ (𝑥 ∈ 𝐹 ∧ 𝑥 ∈ 𝒫 𝐴)) | |
11 | selpw 4115 | . . . . . . . . 9 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴) | |
12 | 11 | anbi2i 726 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐹 ∧ 𝑥 ∈ 𝒫 𝐴) ↔ (𝑥 ∈ 𝐹 ∧ 𝑥 ⊆ 𝐴)) |
13 | 10, 12 | bitri 263 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐹 ∩ 𝒫 𝐴) ↔ (𝑥 ∈ 𝐹 ∧ 𝑥 ⊆ 𝐴)) |
14 | 13 | exbii 1764 | . . . . . 6 ⊢ (∃𝑥 𝑥 ∈ (𝐹 ∩ 𝒫 𝐴) ↔ ∃𝑥(𝑥 ∈ 𝐹 ∧ 𝑥 ⊆ 𝐴)) |
15 | n0 3890 | . . . . . 6 ⊢ ((𝐹 ∩ 𝒫 𝐴) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝐹 ∩ 𝒫 𝐴)) | |
16 | df-rex 2902 | . . . . . 6 ⊢ (∃𝑥 ∈ 𝐹 𝑥 ⊆ 𝐴 ↔ ∃𝑥(𝑥 ∈ 𝐹 ∧ 𝑥 ⊆ 𝐴)) | |
17 | 14, 15, 16 | 3bitr4i 291 | . . . . 5 ⊢ ((𝐹 ∩ 𝒫 𝐴) ≠ ∅ ↔ ∃𝑥 ∈ 𝐹 𝑥 ⊆ 𝐴) |
18 | 17 | a1i 11 | . . . 4 ⊢ (𝐹 ∈ (fBas‘𝑋) → ((𝐹 ∩ 𝒫 𝐴) ≠ ∅ ↔ ∃𝑥 ∈ 𝐹 𝑥 ⊆ 𝐴)) |
19 | 9, 18 | anbi12d 743 | . . 3 ⊢ (𝐹 ∈ (fBas‘𝑋) → ((𝐴 ∈ 𝒫 𝑋 ∧ (𝐹 ∩ 𝒫 𝐴) ≠ ∅) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐹 𝑥 ⊆ 𝐴))) |
20 | 6, 19 | syl5bb 271 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → (𝐴 ∈ {𝑦 ∈ 𝒫 𝑋 ∣ (𝐹 ∩ 𝒫 𝑦) ≠ ∅} ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐹 𝑥 ⊆ 𝐴))) |
21 | 2, 20 | bitrd 267 | 1 ⊢ (𝐹 ∈ (fBas‘𝑋) → (𝐴 ∈ (𝑋filGen𝐹) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐹 𝑥 ⊆ 𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∃wex 1695 ∈ wcel 1977 ≠ wne 2780 ∃wrex 2897 {crab 2900 ∩ cin 3539 ⊆ wss 3540 ∅c0 3874 𝒫 cpw 4108 dom cdm 5038 ‘cfv 5804 (class class class)co 6549 fBascfbas 19555 filGencfg 19556 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-iota 5768 df-fun 5806 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-fg 19565 |
This theorem is referenced by: ssfg 21486 fgss 21487 fgss2 21488 fgfil 21489 elfilss 21490 fgcl 21492 fgabs 21493 fgtr 21504 trfg 21505 uffix 21535 elfm 21561 elfm2 21562 elfm3 21564 fbflim 21590 flffbas 21609 fclsbas 21635 isucn2 21893 metust 22173 cfilucfil 22174 metuel 22179 fgcfil 22877 fgmin 31535 filnetlem4 31546 |
Copyright terms: Public domain | W3C validator |