Theorem filuni 23142

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.

Step	Hyp	Ref	Expression
1		eluni2 4856	. . . 4 ⊢ (𝑥 ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓)
2		ssel2 3927	. . . . . . 7 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑓 ∈ 𝐹) → 𝑓 ∈ (Fil‘𝑋))
3		filelss 23109	. . . . . . . 8 ⊢ ((𝑓 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ 𝑓) → 𝑥 ⊆ 𝑋)
4	3	ex 413	. . . . . . 7 ⊢ (𝑓 ∈ (Fil‘𝑋) → (𝑥 ∈ 𝑓 → 𝑥 ⊆ 𝑋))
5	2, 4	syl 17	. . . . . 6 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑓 ∈ 𝐹) → (𝑥 ∈ 𝑓 → 𝑥 ⊆ 𝑋))
6	5	rexlimdva 3148	. . . . 5 ⊢ (𝐹 ⊆ (Fil‘𝑋) → (∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓 → 𝑥 ⊆ 𝑋))
7	6	3ad2ant1 1132	. . . 4 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → (∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓 → 𝑥 ⊆ 𝑋))
8	1, 7	biimtrid 241	. . 3 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → (𝑥 ∈ ∪ 𝐹 → 𝑥 ⊆ 𝑋))
9	8	pm4.71rd 563	. 2 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → (𝑥 ∈ ∪ 𝐹 ↔ (𝑥 ⊆ 𝑋 ∧ 𝑥 ∈ ∪ 𝐹)))
10		ssn0 4347	. . . 4 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅) → (Fil‘𝑋) ≠ ∅)
11		fvprc 6817	. . . . 5 ⊢ (¬ 𝑋 ∈ V → (Fil‘𝑋) = ∅)
12	11	necon1ai 2968	. . . 4 ⊢ ((Fil‘𝑋) ≠ ∅ → 𝑋 ∈ V)
13	10, 12	syl 17	. . 3 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅) → 𝑋 ∈ V)
14	13	3adant3 1131	. 2 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → 𝑋 ∈ V)
15		filtop 23112	. . . . . . . . 9 ⊢ (𝑓 ∈ (Fil‘𝑋) → 𝑋 ∈ 𝑓)
16	2, 15	syl 17	. . . . . . . 8 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑓 ∈ 𝐹) → 𝑋 ∈ 𝑓)
17	16	a1d 25	. . . . . . 7 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑓 ∈ 𝐹) → (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → 𝑋 ∈ 𝑓))
18	17	ralimdva 3160	. . . . . 6 ⊢ (𝐹 ⊆ (Fil‘𝑋) → (∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → ∀𝑓 ∈ 𝐹 𝑋 ∈ 𝑓))
19		r19.2z 4439	. . . . . . 7 ⊢ ((𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 𝑋 ∈ 𝑓) → ∃𝑓 ∈ 𝐹 𝑋 ∈ 𝑓)
20	19	ex 413	. . . . . 6 ⊢ (𝐹 ≠ ∅ → (∀𝑓 ∈ 𝐹 𝑋 ∈ 𝑓 → ∃𝑓 ∈ 𝐹 𝑋 ∈ 𝑓))
21	18, 20	sylan9 508	. . . . 5 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅) → (∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → ∃𝑓 ∈ 𝐹 𝑋 ∈ 𝑓))
22	21	3impia 1116	. . . 4 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → ∃𝑓 ∈ 𝐹 𝑋 ∈ 𝑓)
23		eluni2 4856	. . . 4 ⊢ (𝑋 ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 𝑋 ∈ 𝑓)
24	22, 23	sylibr 233	. . 3 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → 𝑋 ∈ ∪ 𝐹)
25		sbcel1v 3798	. . 3 ⊢ ([𝑋 / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ 𝑋 ∈ ∪ 𝐹)
26	24, 25	sylibr 233	. 2 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → [𝑋 / 𝑥]𝑥 ∈ ∪ 𝐹)
27		0nelfil 23106	. . . . . 6 ⊢ (𝑓 ∈ (Fil‘𝑋) → ¬ ∅ ∈ 𝑓)
28	2, 27	syl 17	. . . . 5 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑓 ∈ 𝐹) → ¬ ∅ ∈ 𝑓)
29	28	ralrimiva 3139	. . . 4 ⊢ (𝐹 ⊆ (Fil‘𝑋) → ∀𝑓 ∈ 𝐹 ¬ ∅ ∈ 𝑓)
30	29	3ad2ant1 1132	. . 3 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → ∀𝑓 ∈ 𝐹 ¬ ∅ ∈ 𝑓)
31		sbcel1v 3798	. . . . . 6 ⊢ ([∅ / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∅ ∈ ∪ 𝐹)
32		eluni2 4856	. . . . . 6 ⊢ (∅ ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 ∅ ∈ 𝑓)
33	31, 32	bitri 274	. . . . 5 ⊢ ([∅ / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 ∅ ∈ 𝑓)
34	33	notbii 319	. . . 4 ⊢ (¬ [∅ / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ¬ ∃𝑓 ∈ 𝐹 ∅ ∈ 𝑓)
35		ralnex 3072	. . . 4 ⊢ (∀𝑓 ∈ 𝐹 ¬ ∅ ∈ 𝑓 ↔ ¬ ∃𝑓 ∈ 𝐹 ∅ ∈ 𝑓)
36	34, 35	bitr4i 277	. . 3 ⊢ (¬ [∅ / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∀𝑓 ∈ 𝐹 ¬ ∅ ∈ 𝑓)
37	30, 36	sylibr 233	. 2 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → ¬ [∅ / 𝑥]𝑥 ∈ ∪ 𝐹)
38		simp13 1204	. . . . 5 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹)
39		r19.29 3113	. . . . . 6 ⊢ ((∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ ∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓) → ∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓))
40	39	ex 413	. . . . 5 ⊢ (∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → (∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓 → ∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓)))
41	38, 40	syl 17	. . . 4 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → (∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓 → ∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓)))
42		simp1 1135	. . . . 5 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → 𝐹 ⊆ (Fil‘𝑋))
43		simp1 1135	. . . . . . . . 9 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → 𝐹 ⊆ (Fil‘𝑋))
44		simpl 483	. . . . . . . . 9 ⊢ ((𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓)) → 𝑓 ∈ 𝐹)
45	43, 44, 2	syl2an 596	. . . . . . . 8 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) ∧ (𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓))) → 𝑓 ∈ (Fil‘𝑋))
46		simprrr 779	. . . . . . . 8 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) ∧ (𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓))) → 𝑥 ∈ 𝑓)
47		simpl2 1191	. . . . . . . 8 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) ∧ (𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓))) → 𝑦 ⊆ 𝑋)
48		simpl3 1192	. . . . . . . 8 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) ∧ (𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓))) → 𝑥 ⊆ 𝑦)
49		filss 23110	. . . . . . . 8 ⊢ ((𝑓 ∈ (Fil‘𝑋) ∧ (𝑥 ∈ 𝑓 ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦)) → 𝑦 ∈ 𝑓)
50	45, 46, 47, 48, 49	syl13anc 1371	. . . . . . 7 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) ∧ (𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓))) → 𝑦 ∈ 𝑓)
51	50	expr 457	. . . . . 6 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) ∧ 𝑓 ∈ 𝐹) → ((∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓) → 𝑦 ∈ 𝑓))
52	51	reximdva 3161	. . . . 5 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → (∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓) → ∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓))
53	42, 52	syl3an1 1162	. . . 4 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → (∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑓) → ∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓))
54	41, 53	syld 47	. . 3 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → (∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓 → ∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓))
55		sbcel1v 3798	. . . 4 ⊢ ([𝑥 / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ 𝑥 ∈ ∪ 𝐹)
56	55, 1	bitri 274	. . 3 ⊢ ([𝑥 / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 𝑥 ∈ 𝑓)
57		sbcel1v 3798	. . . 4 ⊢ ([𝑦 / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ 𝑦 ∈ ∪ 𝐹)
58		eluni2 4856	. . . 4 ⊢ (𝑦 ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓)
59	57, 58	bitri 274	. . 3 ⊢ ([𝑦 / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓)
60	54, 56, 59	3imtr4g 295	. 2 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑦) → ([𝑥 / 𝑥]𝑥 ∈ ∪ 𝐹 → [𝑦 / 𝑥]𝑥 ∈ ∪ 𝐹))
61		simp13 1204	. . . . 5 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹)
62		r19.29 3113	. . . . . 6 ⊢ ((∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ ∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓) → ∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓))
63	62	ex 413	. . . . 5 ⊢ (∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → (∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓 → ∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓)))
64	61, 63	syl 17	. . . 4 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → (∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓 → ∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓)))
65		simp11 1202	. . . . 5 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → 𝐹 ⊆ (Fil‘𝑋))
66		r19.29 3113	. . . . . . . . . . 11 ⊢ ((∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔) → ∃𝑔 ∈ 𝐹 ((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑔))
67	66	ex 413	. . . . . . . . . 10 ⊢ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → (∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔 → ∃𝑔 ∈ 𝐹 ((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑔)))
68		elun1 4123	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ 𝑓 → 𝑦 ∈ (𝑓 ∪ 𝑔))
69		elun2 4124	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ 𝑔 → 𝑥 ∈ (𝑓 ∪ 𝑔))
70	68, 69	anim12i 613	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ 𝑓 ∧ 𝑥 ∈ 𝑔) → (𝑦 ∈ (𝑓 ∪ 𝑔) ∧ 𝑥 ∈ (𝑓 ∪ 𝑔)))
71		eleq2 2825	. . . . . . . . . . . . . . . . 17 ⊢ (ℎ = (𝑓 ∪ 𝑔) → (𝑦 ∈ ℎ ↔ 𝑦 ∈ (𝑓 ∪ 𝑔)))
72		eleq2 2825	. . . . . . . . . . . . . . . . 17 ⊢ (ℎ = (𝑓 ∪ 𝑔) → (𝑥 ∈ ℎ ↔ 𝑥 ∈ (𝑓 ∪ 𝑔)))
73	71, 72	anbi12d 631	. . . . . . . . . . . . . . . 16 ⊢ (ℎ = (𝑓 ∪ 𝑔) → ((𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ) ↔ (𝑦 ∈ (𝑓 ∪ 𝑔) ∧ 𝑥 ∈ (𝑓 ∪ 𝑔))))
74	73	rspcev 3570	. . . . . . . . . . . . . . 15 ⊢ (((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ (𝑦 ∈ (𝑓 ∪ 𝑔) ∧ 𝑥 ∈ (𝑓 ∪ 𝑔))) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ))
75	70, 74	sylan2 593	. . . . . . . . . . . . . 14 ⊢ (((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ (𝑦 ∈ 𝑓 ∧ 𝑥 ∈ 𝑔)) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ))
76	75	an12s 646	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝑓 ∧ ((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑔)) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ))
77	76	ex 413	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝑓 → (((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑔) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ)))
78	77	ad2antlr 724	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ 𝐹 ∧ 𝑦 ∈ 𝑓) ∧ 𝑔 ∈ 𝐹) → (((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑔) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ)))
79	78	rexlimdva 3148	. . . . . . . . . 10 ⊢ ((𝑓 ∈ 𝐹 ∧ 𝑦 ∈ 𝑓) → (∃𝑔 ∈ 𝐹 ((𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑥 ∈ 𝑔) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ)))
80	67, 79	syl9r 78	. . . . . . . . 9 ⊢ ((𝑓 ∈ 𝐹 ∧ 𝑦 ∈ 𝑓) → (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 → (∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔 → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ))))
81	80	impr 455	. . . . . . . 8 ⊢ ((𝑓 ∈ 𝐹 ∧ (𝑦 ∈ 𝑓 ∧ ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹)) → (∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔 → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ)))
82	81	ancom2s 647	. . . . . . 7 ⊢ ((𝑓 ∈ 𝐹 ∧ (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓)) → (∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔 → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ)))
83	82	rexlimiva 3140	. . . . . 6 ⊢ (∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓) → (∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔 → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ)))
84	83	imp 407	. . . . 5 ⊢ ((∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓) ∧ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔) → ∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ))
85		ssel2 3927	. . . . . . 7 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ ℎ ∈ 𝐹) → ℎ ∈ (Fil‘𝑋))
86		filin 23111	. . . . . . . 8 ⊢ ((ℎ ∈ (Fil‘𝑋) ∧ 𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ) → (𝑦 ∩ 𝑥) ∈ ℎ)
87	86	3expib 1121	. . . . . . 7 ⊢ (ℎ ∈ (Fil‘𝑋) → ((𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ) → (𝑦 ∩ 𝑥) ∈ ℎ))
88	85, 87	syl 17	. . . . . 6 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ ℎ ∈ 𝐹) → ((𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ) → (𝑦 ∩ 𝑥) ∈ ℎ))
89	88	reximdva 3161	. . . . 5 ⊢ (𝐹 ⊆ (Fil‘𝑋) → (∃ℎ ∈ 𝐹 (𝑦 ∈ ℎ ∧ 𝑥 ∈ ℎ) → ∃ℎ ∈ 𝐹 (𝑦 ∩ 𝑥) ∈ ℎ))
90	65, 84, 89	syl2im 40	. . . 4 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → ((∃𝑓 ∈ 𝐹 (∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹 ∧ 𝑦 ∈ 𝑓) ∧ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔) → ∃ℎ ∈ 𝐹 (𝑦 ∩ 𝑥) ∈ ℎ))
91	64, 90	syland 603	. . 3 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → ((∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓 ∧ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔) → ∃ℎ ∈ 𝐹 (𝑦 ∩ 𝑥) ∈ ℎ))
92		eluni2 4856	. . . . 5 ⊢ (𝑥 ∈ ∪ 𝐹 ↔ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔)
93	55, 92	bitri 274	. . . 4 ⊢ ([𝑥 / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔)
94	59, 93	anbi12i 627	. . 3 ⊢ (([𝑦 / 𝑥]𝑥 ∈ ∪ 𝐹 ∧ [𝑥 / 𝑥]𝑥 ∈ ∪ 𝐹) ↔ (∃𝑓 ∈ 𝐹 𝑦 ∈ 𝑓 ∧ ∃𝑔 ∈ 𝐹 𝑥 ∈ 𝑔))
95		sbcel1v 3798	. . . 4 ⊢ ([(𝑦 ∩ 𝑥) / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ (𝑦 ∩ 𝑥) ∈ ∪ 𝐹)
96		eluni2 4856	. . . 4 ⊢ ((𝑦 ∩ 𝑥) ∈ ∪ 𝐹 ↔ ∃ℎ ∈ 𝐹 (𝑦 ∩ 𝑥) ∈ ℎ)
97	95, 96	bitri 274	. . 3 ⊢ ([(𝑦 ∩ 𝑥) / 𝑥]𝑥 ∈ ∪ 𝐹 ↔ ∃ℎ ∈ 𝐹 (𝑦 ∩ 𝑥) ∈ ℎ)
98	91, 94, 97	3imtr4g 295	. 2 ⊢ (((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) ∧ 𝑦 ⊆ 𝑋 ∧ 𝑥 ⊆ 𝑋) → (([𝑦 / 𝑥]𝑥 ∈ ∪ 𝐹 ∧ [𝑥 / 𝑥]𝑥 ∈ ∪ 𝐹) → [(𝑦 ∩ 𝑥) / 𝑥]𝑥 ∈ ∪ 𝐹))
99	9, 14, 26, 37, 60, 98	isfild 23115	1 ⊢ ((𝐹 ⊆ (Fil‘𝑋) ∧ 𝐹 ≠ ∅ ∧ ∀𝑓 ∈ 𝐹 ∀𝑔 ∈ 𝐹 (𝑓 ∪ 𝑔) ∈ 𝐹) → ∪ 𝐹 ∈ (Fil‘𝑋))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   ∧ w3a 1086   = wceq 1540   ∈ wcel 2105   ≠ wne 2940  ∀wral 3061  ∃wrex 3070  Vcvv 3441  [wsbc 3727   ∪ cun 3896   ∩ cin 3897   ⊆ wss 3898  ∅c0 4269  ∪ cuni 4852  ‘cfv 6479  Filcfil 23102

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2707  ax-sep 5243  ax-nul 5250  ax-pow 5308  ax-pr 5372

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rab 3404  df-v 3443  df-sbc 3728  df-csb 3844  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4270  df-if 4474  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4853  df-br 5093  df-opab 5155  df-mpt 5176  df-id 5518  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-iota 6431  df-fun 6481  df-fv 6487  df-fbas 20700  df-fil 23103

This theorem is referenced by:  filssufilg  23168