MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isfil2 Structured version   Visualization version   GIF version

Theorem isfil2 24168
Description: Derive the standard axioms of a filter. (Contributed by Mario Carneiro, 27-Nov-2013.) (Revised by Stefan O'Rear, 2-Aug-2015.)
Assertion
Ref Expression
isfil2 (𝐹 ∈ (Fil‘𝑋) ↔ ((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹))
Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝑋,𝑦

Proof of Theorem isfil2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 filsspw 24163 . . . 4 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ⊆ 𝒫 𝑋)
2 0nelfil 24161 . . . 4 (𝐹 ∈ (Fil‘𝑋) → ¬ ∅ ∈ 𝐹)
3 filtop 24167 . . . 4 (𝐹 ∈ (Fil‘𝑋) → 𝑋 ∈ 𝐹)
41, 2, 33jca 1146 . . 3 (𝐹 ∈ (Fil‘𝑋) → (𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹))
5 elpwi 4564 . . . . 5 (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋)
6 filss 24165 . . . . . . . . 9 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑦 ∈ 𝐹 ∧ 𝑥 ⊆ 𝑋 ∧ 𝑦 ⊆ 𝑥)) → 𝑥 ∈ 𝐹)
763exp2 1373 . . . . . . . 8 (𝐹 ∈ (Fil‘𝑋) → (𝑦 ∈ 𝐹 → (𝑥 ⊆ 𝑋 → (𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹))))
87com23 87 . . . . . . 7 (𝐹 ∈ (Fil‘𝑋) → (𝑥 ⊆ 𝑋 → (𝑦 ∈ 𝐹 → (𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹))))
98imp 412 . . . . . 6 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → (𝑦 ∈ 𝐹 → (𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹)))
109rexlimdv 3162 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑥 ⊆ 𝑋) → (∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹))
115, 10sylan2 605 . . . 4 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ 𝒫 𝑋) → (∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹))
1211ralrimiva 3155 . . 3 (𝐹 ∈ (Fil‘𝑋) → ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹))
13 filin 24166 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 ∩ 𝑦) ∈ 𝐹)
14133expb 1138 . . . 4 ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → (𝑥 ∩ 𝑦) ∈ 𝐹)
1514ralrimivva 3206 . . 3 (𝐹 ∈ (Fil‘𝑋) → ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹)
164, 12, 153jca 1146 . 2 (𝐹 ∈ (Fil‘𝑋) → ((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹))
17 simp11 1222 . . . 4 (((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹) → 𝐹 ⊆ 𝒫 𝑋)
18 simp13 1224 . . . . . 6 (((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹) → 𝑋 ∈ 𝐹)
1918ne0d 4288 . . . . 5 (((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹) → 𝐹 ≠ ∅)
20 simp12 1223 . . . . . 6 (((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹) → ¬ ∅ ∈ 𝐹)
21 df-nel 3063 . . . . . 6 (∅ ∉ 𝐹 ↔ ¬ ∅ ∈ 𝐹)
2220, 21sylibr 237 . . . . 5 (((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹) → ∅ ∉ 𝐹)
23 ssid 3953 . . . . . . . . 9 (𝑥 ∩ 𝑦) ⊆ (𝑥 ∩ 𝑦)
24 sseq1 3956 . . . . . . . . . 10 (𝑧 = (𝑥 ∩ 𝑦) → (𝑧 ⊆ (𝑥 ∩ 𝑦) ↔ (𝑥 ∩ 𝑦) ⊆ (𝑥 ∩ 𝑦)))
2524rspcev 3577 . . . . . . . . 9 (((𝑥 ∩ 𝑦) ∈ 𝐹 ∧ (𝑥 ∩ 𝑦) ⊆ (𝑥 ∩ 𝑦)) → ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))
2623, 25mpan2 704 . . . . . . . 8 ((𝑥 ∩ 𝑦) ∈ 𝐹 → ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))
2726ralimi 3100 . . . . . . 7 (∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹 → ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))
2827ralimi 3100 . . . . . 6 (∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹 → ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))
29283ad2ant3 1153 . . . . 5 (((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹) → ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))
3019, 22, 293jca 1146 . . . 4 (((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹) → (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)))
31 isfbas2 24147 . . . . 5 (𝑋 ∈ 𝐹 → (𝐹 ∈ (fBas‘𝑋) ↔ (𝐹 ⊆ 𝒫 𝑋 ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)))))
3218, 31syl 18 . . . 4 (((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹) → (𝐹 ∈ (fBas‘𝑋) ↔ (𝐹 ⊆ 𝒫 𝑋 ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)))))
3317, 30, 32mpbir2and 726 . . 3 (((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹) → 𝐹 ∈ (fBas‘𝑋))
34 n0 4300 . . . . . . . 8 ((𝐹 ∩ 𝒫 𝑥) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ (𝐹 ∩ 𝒫 𝑥))
35 elin 3915 . . . . . . . . . 10 (𝑦 ∈ (𝐹 ∩ 𝒫 𝑥) ↔ (𝑦 ∈ 𝐹 ∧ 𝑦 ∈ 𝒫 𝑥))
36 elpwi 4564 . . . . . . . . . . 11 (𝑦 ∈ 𝒫 𝑥 → 𝑦 ⊆ 𝑥)
3736anim2i 629 . . . . . . . . . 10 ((𝑦 ∈ 𝐹 ∧ 𝑦 ∈ 𝒫 𝑥) → (𝑦 ∈ 𝐹 ∧ 𝑦 ⊆ 𝑥))
3835, 37sylbi 220 . . . . . . . . 9 (𝑦 ∈ (𝐹 ∩ 𝒫 𝑥) → (𝑦 ∈ 𝐹 ∧ 𝑦 ⊆ 𝑥))
3938eximi 1868 . . . . . . . 8 (∃𝑦 𝑦 ∈ (𝐹 ∩ 𝒫 𝑥) → ∃𝑦(𝑦 ∈ 𝐹 ∧ 𝑦 ⊆ 𝑥))
4034, 39sylbi 220 . . . . . . 7 ((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → ∃𝑦(𝑦 ∈ 𝐹 ∧ 𝑦 ⊆ 𝑥))
41 df-rex 3088 . . . . . . 7 (∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 ↔ ∃𝑦(𝑦 ∈ 𝐹 ∧ 𝑦 ⊆ 𝑥))
4240, 41sylibr 237 . . . . . 6 ((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → ∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥)
4342imim1i 64 . . . . 5 ((∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) → ((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥 ∈ 𝐹))
4443ralimi 3100 . . . 4 (∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) → ∀𝑥 ∈ 𝒫 𝑋((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥 ∈ 𝐹))
45443ad2ant2 1152 . . 3 (((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹) → ∀𝑥 ∈ 𝒫 𝑋((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥 ∈ 𝐹))
46 isfil 24159 . . 3 (𝐹 ∈ (Fil‘𝑋) ↔ (𝐹 ∈ (fBas‘𝑋) ∧ ∀𝑥 ∈ 𝒫 𝑋((𝐹 ∩ 𝒫 𝑥) ≠ ∅ → 𝑥 ∈ 𝐹)))
4733, 45, 46sylanbrc 595 . 2 (((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹) → 𝐹 ∈ (Fil‘𝑋))
4816, 47impbii 212 1 (𝐹 ∈ (Fil‘𝑋) ↔ ((𝐹 ⊆ 𝒫 𝑋 ∧ ¬ ∅ ∈ 𝐹 ∧ 𝑋 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝒫 𝑋(∃𝑦 ∈ 𝐹 𝑦 ⊆ 𝑥 → 𝑥 ∈ 𝐹) ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝑥 ∩ 𝑦) ∈ 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∃wex 1812   ∈ wcel 2145   ≠ wne 2956   ∉ wnel 3062  ∀wral 3077  ∃wrex 3087   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  ‘cfv 6537  fBascfbas 21659  Filcfil 24157
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fv 6545  df-fbas 21668  df-fil 24158
This theorem is used by:  isfild  24170  infil  24175  neifil  24192  trfil2  24199
  Copyright terms: Public domain W3C validator