Metamath Proof Explorer


Theorem ufilmax

Description: Any filter finer than an ultrafilter is actually equal to it. (Contributed by Jeff Hankins, 1-Dec-2009) (Revised by Mario Carneiro, 29-Jul-2015)

Ref Expression
Assertion ufilmax ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G → F = G

Proof

Step Hyp Ref Expression
1 simp3 ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G → F ⊆ G
2 filelss ⊢ G ∈ Fil ⁡ X ∧ x ∈ G → x ⊆ X
3 2 ex ⊢ G ∈ Fil ⁡ X → x ∈ G → x ⊆ X
4 3 3ad2ant2 ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G → x ∈ G → x ⊆ X
5 ufilb ⊢ F ∈ UFil ⁡ X ∧ x ⊆ X → ¬ x ∈ F ↔ X ∖ x ∈ F
6 5 3ad2antl1 ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G ∧ x ⊆ X → ¬ x ∈ F ↔ X ∖ x ∈ F
7 simpl3 ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G ∧ x ⊆ X → F ⊆ G
8 7 sseld ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G ∧ x ⊆ X → X ∖ x ∈ F → X ∖ x ∈ G
9 filfbas ⊢ G ∈ Fil ⁡ X → G ∈ fBas ⁡ X
10 fbncp ⊢ G ∈ fBas ⁡ X ∧ x ∈ G → ¬ X ∖ x ∈ G
11 10 ex ⊢ G ∈ fBas ⁡ X → x ∈ G → ¬ X ∖ x ∈ G
12 9 11 syl ⊢ G ∈ Fil ⁡ X → x ∈ G → ¬ X ∖ x ∈ G
13 12 con2d ⊢ G ∈ Fil ⁡ X → X ∖ x ∈ G → ¬ x ∈ G
14 13 3ad2ant2 ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G → X ∖ x ∈ G → ¬ x ∈ G
15 14 adantr ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G ∧ x ⊆ X → X ∖ x ∈ G → ¬ x ∈ G
16 8 15 syld ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G ∧ x ⊆ X → X ∖ x ∈ F → ¬ x ∈ G
17 6 16 sylbid ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G ∧ x ⊆ X → ¬ x ∈ F → ¬ x ∈ G
18 17 con4d ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G ∧ x ⊆ X → x ∈ G → x ∈ F
19 18 ex ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G → x ⊆ X → x ∈ G → x ∈ F
20 19 com23 ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G → x ∈ G → x ⊆ X → x ∈ F
21 4 20 mpdd ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G → x ∈ G → x ∈ F
22 21 ssrdv ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G → G ⊆ F
23 1 22 eqssd ⊢ F ∈ UFil ⁡ X ∧ G ∈ Fil ⁡ X ∧ F ⊆ G → F = G