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

Theorem filuni 24259
Description: The union of a nonempty set of filters with a common base and closed under pairwise union is a filter. (Contributed by Mario Carneiro, 28-Nov-2013.) (Revised by Stefan O'Rear, 2-Aug-2015.)
Assertion
Ref Expression
filuni ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → ∪ 𝐹 ∈ (Fil‘𝑋))
Distinct variable groups:   𝑓,𝑔,𝐹   𝑓,𝑋,𝑔

Proof of Theorem filuni
Dummy variables ℎ 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eluni2 4876 . . . 4 (𝑥 ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓)
2 ssel2 3908 . . . . . . 7 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑓 ∈ 𝐹) → 𝑓 ∈ (Fil‘𝑋))
3 filelss 24226 . . . . . . . 8 ((𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ 𝑓) → 𝑥 ⊆ 𝑋)
43ex 418 . . . . . . 7 (𝑓 ∈ (Fil‘𝑋) → (𝑥 ∈ 𝑓 → 𝑥 ⊆ 𝑋))
52, 4syl 18 . . . . . 6 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑓 ∈ 𝐹) → (𝑥 ∈ 𝑓 → 𝑥 ⊆ 𝑋))
65rexlimdva 3167 . . . . 5 (𝐹 ⊆ (Fil‘𝑋) → (∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓 → 𝑥 ⊆ 𝑋))
763ad2ant1 1151 . . . 4 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → (∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓 → 𝑥 ⊆ 𝑋))
81, 7biimtrid 245 . . 3 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → (𝑥 ∈ ∪ 𝐹 → 𝑥 ⊆ 𝑋))
98pm4.71rd 572 . 2 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → (𝑥 ∈ ∪ 𝐹 ↔ (𝑥 ⊆ 𝑋 ∧ 𝑥 ∈ ∪ 𝐹)))
10 ssn0 4358 . . . 4 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅) → (Fil‘𝑋) ≠ ∅)
11 fvprc 6908 . . . . 5 (¬ 𝑋 ∈ V → (Fil‘𝑋) = ∅)
1211necon1ai 2986 . . . 4 ((Fil‘𝑋) ≠ ∅ → 𝑋 ∈ V)
1310, 12syl 18 . . 3 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅) → 𝑋 ∈ V)
14133adant3 1150 . 2 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → 𝑋 ∈ V)
15 filtop 24229 . . . . . . . . 9 (𝑓 ∈ (Fil‘𝑋) → 𝑋 ∈ 𝑓)
162, 15syl 18 . . . . . . . 8 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑓 ∈ 𝐹) → 𝑋 ∈ 𝑓)
1716a1d 26 . . . . . . 7 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑓 ∈ 𝐹) → (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → 𝑋 ∈ 𝑓))
1817ralimdva 3178 . . . . . 6 (𝐹 ⊆ (Fil‘𝑋) → (∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → ∀𝑓 ∈ 𝐹 𝑋 ∈ 𝑓))
19 r19.2z 4458 . . . . . . 7 ((𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 𝑋 ∈ 𝑓) → ∃𝑓 ∈ 𝐹 𝑋 ∈ 𝑓)
2019ex 418 . . . . . 6 (𝐹 ≠ ∅ → (∀𝑓 ∈ 𝐹 𝑋 ∈ 𝑓 → ∃𝑓 ∈ 𝐹 𝑋 ∈ 𝑓))
2118, 20sylan9 517 . . . . 5 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅) → (∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → ∃𝑓 ∈ 𝐹 𝑋 ∈ 𝑓))
22213impia 1135 . . . 4 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → ∃𝑓 ∈ 𝐹 𝑋 ∈ 𝑓)
23 eluni2 4876 . . . 4 (𝑋 ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 𝑋 ∈ 𝑓)
2422, 23sylibr 237 . . 3 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → 𝑋 ∈ ∪ 𝐹)
25 sbcel1v 3807 . . 3 ([𝑋 / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ 𝑋 ∈ ∪ 𝐹)
2624, 25sylibr 237 . 2 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → [𝑋 / 𝑥]𝑥 ∈ ∪ 𝐹)
27 0nelfil 24223 . . . . . 6 (𝑓 ∈ (Fil‘𝑋) → ¬ ∅ ∈ 𝑓)
282, 27syl 18 . . . . 5 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑓 ∈ 𝐹) → ¬ ∅ ∈ 𝑓)
2928ralrimiva 3158 . . . 4 (𝐹 ⊆ (Fil‘𝑋) → ∀𝑓 ∈ 𝐹 ¬ ∅ ∈ 𝑓)
30293ad2ant1 1151 . . 3 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → ∀𝑓 ∈ 𝐹 ¬ ∅ ∈ 𝑓)
31 sbcel1v 3807 . . . . . 6 ([∅ / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∅ ∈ ∪ 𝐹)
32 eluni2 4876 . . . . . 6 (∅ ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 ∅ ∈ 𝑓)
3331, 32bitri 278 . . . . 5 ([∅ / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 ∅ ∈ 𝑓)
3433notbii 323 . . . 4 (¬ [∅ / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ¬ ∃𝑓 ∈ 𝐹 ∅ ∈ 𝑓)
35 ralnex 3092 . . . 4 (∀𝑓 ∈ 𝐹 ¬ ∅ ∈ 𝑓 ↔ ¬ ∃𝑓 ∈ 𝐹 ∅ ∈ 𝑓)
3634, 35bitr4i 281 . . 3 (¬ [∅ / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∀𝑓 ∈ 𝐹 ¬ ∅ ∈ 𝑓)
3730, 36sylibr 237 . 2 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → ¬ [∅ / 𝑥]𝑥 ∈ ∪ 𝐹)
38 simp13 1224 . . . . 5 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹)
39 r19.29 3129 . . . . . 6 ((∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ ∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓) → ∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓))
4039ex 418 . . . . 5 (∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → (∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓 → ∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓)))
4138, 40syl 18 . . . 4 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → (∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓 → ∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓)))
42 simp1 1154 . . . . 5 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → 𝐹 ⊆ (Fil‘𝑋))
43 simp1 1154 . . . . . . . . 9 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → 𝐹 ⊆ (Fil‘𝑋))
44 simpl 488 . . . . . . . . 9 ((𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓)) → 𝑓 ∈ 𝐹)
4543, 44, 2syl2an 608 . . . . . . . 8 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) ∧ (𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓))) → 𝑓 ∈ (Fil‘𝑋))
46 simprrr 794 . . . . . . . 8 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) ∧ (𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓))) → 𝑥 ∈ 𝑓)
47 simpl2 1211 . . . . . . . 8 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) ∧ (𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓))) → 𝑦 ⊆ 𝑋)
48 simpl3 1212 . . . . . . . 8 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) ∧ (𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓))) → 𝑥 ⊆ 𝑦)
49 filss 24227 . . . . . . . 8 ((𝑓 ∈ (Fil‘𝑋) ∧ (𝑥 ∈ 𝑓 ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦)) → 𝑦 ∈ 𝑓)
5045, 46, 47, 48, 49syl13anc 1400 . . . . . . 7 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) ∧ (𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓))) → 𝑦 ∈ 𝑓)
5150expr 462 . . . . . 6 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) ∧ 𝑓 ∈ 𝐹) → ((∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓) → 𝑦 ∈ 𝑓))
5251reximdva 3179 . . . . 5 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → (∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓) → ∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓))
5342, 52syl3an1 1181 . . . 4 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → (∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓) → ∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓))
5441, 53syld 48 . . 3 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → (∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓 → ∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓))
55 sbcel1v 3807 . . . 4 ([𝑥 / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ 𝑥 ∈ ∪ 𝐹)
5655, 1bitri 278 . . 3 ([𝑥 / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓)
57 sbcel1v 3807 . . . 4 ([𝑦 / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ 𝑦 ∈ ∪ 𝐹)
58 eluni2 4876 . . . 4 (𝑦 ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓)
5957, 58bitri 278 . . 3 ([𝑦 / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓)
6054, 56, 593imtr4g 299 . 2 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → ([𝑥 / 𝑥]𝑥 ∈ ∪ 𝐹 → [𝑦 / 𝑥]𝑥 ∈ ∪ 𝐹))
61 simp13 1224 . . . . 5 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹)
62 r19.29 3129 . . . . . 6 ((∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ ∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓) → ∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓))
6362ex 418 . . . . 5 (∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → (∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓 → ∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓)))
6461, 63syl 18 . . . 4 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → (∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓 → ∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓)))
65 simp11 1222 . . . . 5 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → 𝐹 ⊆ (Fil‘𝑋))
66 r19.29 3129 . . . . . . . . . . 11 ((∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔) → ∃𝑔 ∈ 𝐹 ((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑔))
6766ex 418 . . . . . . . . . 10 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → (∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔 → ∃𝑔 ∈ 𝐹 ((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑔)))
68 elun1 4183 . . . . . . . . . . . . . . . 16 (𝑦 ∈ 𝑓 → 𝑦 ∈ (𝑓 ∪ 𝑔))
69 elun2 4184 . . . . . . . . . . . . . . . 16 (𝑥 ∈ 𝑔 → 𝑥 ∈ (𝑓 ∪ 𝑔))
7068, 69anim12i 625 . . . . . . . . . . . . . . 15 ((𝑦 ∈ 𝑓 ∧ 𝑥 ∈ 𝑔) → (𝑦 ∈ (𝑓 ∪ 𝑔) ∧ 𝑥 ∈ (𝑓 ∪ 𝑔)))
71 eleq2 2853 . . . . . . . . . . . . . . . . 17 (ℎ = (𝑓 ∪ 𝑔) → (𝑦 ∈ ℎ ↔ 𝑦 ∈ (𝑓 ∪ 𝑔)))
72 eleq2 2853 . . . . . . . . . . . . . . . . 17 (ℎ = (𝑓 ∪ 𝑔) → (𝑥 ∈ ℎ ↔ 𝑥 ∈ (𝑓 ∪ 𝑔)))
7371, 72anbi12d 644 . . . . . . . . . . . . . . . 16 (ℎ = (𝑓 ∪ 𝑔) → ((𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ) ↔ (𝑦 ∈ (𝑓 ∪ 𝑔) ∧ 𝑥 ∈ (𝑓 ∪ 𝑔))))
7473rspcev 3580 . . . . . . . . . . . . . . 15 (((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ (𝑦 ∈ (𝑓 ∪ 𝑔) ∧ 𝑥 ∈ (𝑓 ∪ 𝑔))) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ))
7570, 74sylan2 605 . . . . . . . . . . . . . 14 (((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ (𝑦 ∈ 𝑓 ∧ 𝑥 ∈ 𝑔)) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ))
7675an12s 662 . . . . . . . . . . . . 13 ((𝑦 ∈ 𝑓 ∧ ((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑔)) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ))
7776ex 418 . . . . . . . . . . . 12 (𝑦 ∈ 𝑓 → (((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑔) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ)))
7877ad2antlr 740 . . . . . . . . . . 11 (((𝑓 ∈ 𝐹 ∧ 𝑦 ∈ 𝑓) ∧ 𝑔 ∈ 𝐹) → (((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑔) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ)))
7978rexlimdva 3167 . . . . . . . . . 10 ((𝑓 ∈ 𝐹 ∧ 𝑦 ∈ 𝑓) → (∃𝑔 ∈ 𝐹 ((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑔) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ)))
8067, 79syl9r 79 . . . . . . . . 9 ((𝑓 ∈ 𝐹 ∧ 𝑦 ∈ 𝑓) → (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → (∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔 → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ))))
8180impr 460 . . . . . . . 8 ((𝑓 ∈ 𝐹 ∧ (𝑦 ∈ 𝑓 ∧ ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹)) → (∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔 → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ)))
8281ancom2s 663 . . . . . . 7 ((𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓)) → (∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔 → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ)))
8382rexlimiva 3159 . . . . . 6 (∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓) → (∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔 → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ)))
8483imp 412 . . . . 5 ((∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓) ∧ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ))
85 ssel2 3908 . . . . . . 7 ((𝐹 ⊆ (Fil‘𝑋) ∧ ℎ ∈ 𝐹) → ℎ ∈ (Fil‘𝑋))
86 filin 24228 . . . . . . . 8 ((ℎ ∈ (Fil‘𝑋) ∧ 𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ) → (𝑦 ∩ 𝑥) ∈ ℎ)
87863expib 1140 . . . . . . 7 (ℎ ∈ (Fil‘𝑋) → ((𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ) → (𝑦 ∩ 𝑥) ∈ ℎ))
8885, 87syl 18 . . . . . 6 ((𝐹 ⊆ (Fil‘𝑋) ∧ ℎ ∈ 𝐹) → ((𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ) → (𝑦 ∩ 𝑥) ∈ ℎ))
8988reximdva 3179 . . . . 5 (𝐹 ⊆ (Fil‘𝑋) → (∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ) → ∃ℎ ∈ 𝐹 (𝑦 ∩ 𝑥) ∈ ℎ))
9065, 84, 89syl2im 41 . . . 4 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → ((∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓) ∧ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔) → ∃ℎ ∈ 𝐹 (𝑦 ∩ 𝑥) ∈ ℎ))
9164, 90syland 615 . . 3 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → ((∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓 ∧ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔) → ∃ℎ ∈ 𝐹 (𝑦 ∩ 𝑥) ∈ ℎ))
92 eluni2 4876 . . . . 5 (𝑥 ∈ ∪ 𝐹 ↔ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔)
9355, 92bitri 278 . . . 4 ([𝑥 / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔)
9459, 93anbi12i 640 . . 3 (([𝑦 / 𝑥]𝑥 ∈ ∪ 𝐹 ∧ [𝑥 / 𝑥]𝑥 ∈ ∪ 𝐹) ↔ (∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓 ∧ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔))
95 sbcel1v 3807 . . . 4 ([(𝑦 ∩ 𝑥) / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ (𝑦 ∩ 𝑥) ∈ ∪ 𝐹)
96 eluni2 4876 . . . 4 ((𝑦 ∩ 𝑥) ∈ ∪ 𝐹 ↔ ∃ℎ ∈ 𝐹 (𝑦 ∩ 𝑥) ∈ ℎ)
9795, 96bitri 278 . . 3 ([(𝑦 ∩ 𝑥) / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∃ℎ ∈ 𝐹 (𝑦 ∩ 𝑥) ∈ ℎ)
9891, 94, 973imtr4g 299 . 2 (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → (([𝑦 / 𝑥]𝑥 ∈ ∪ 𝐹 ∧ [𝑥 / 𝑥]𝑥 ∈ ∪ 𝐹) → [(𝑦 ∩ 𝑥) / 𝑥]𝑥 ∈ ∪ 𝐹))
999, 14, 26, 37, 60, 98isfild 24232 1 ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → ∪ 𝐹 ∈ (Fil‘𝑋))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  Vcvv 3454  [wsbc 3742   ⊆ wss 3900   ∩ cin 4092   ∪ cun 4152  ∅c0 4281  ∪ cuni 4872  ‘cfv 6566  Filcfil 24219
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fv 6574  df-fbas 21726  df-fil 24220
This theorem is used by:  filssufilg  24285
  Copyright terms: Public domain W3C validator