Theorem filssufilg 24083

Description: A filter is contained in some ultrafilter. This version of filssufil 24084 contains the choice as a hypothesis (in the assumption that 𝒫 𝒫 𝑋 is well-orderable). (Contributed by Mario Carneiro, 24-May-2015.) (Revised by Stefan O'Rear, 2-Aug-2015.)

Assertion

Ref	Expression
filssufilg	⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → ∃𝑓 ∈ (UFil‘𝑋)𝐹 ⊆ 𝑓)

Distinct variable groups:   𝑓,𝐹   𝑓,𝑋

Proof of Theorem filssufilg

Dummy variables 𝑔 ℎ 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 490	. . . 4 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → 𝒫 𝒫 𝑋 ∈ dom card)
2		rabss 4027	. . . . 5 ⊢ ({𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ⊆ 𝒫 𝒫 𝑋 ↔ ∀𝑔 ∈ (Fil‘𝑋)(𝐹 ⊆ 𝑔 → 𝑔 ∈ 𝒫 𝒫 𝑋))
3		filsspw 24023	. . . . . . 7 ⊢ (𝑔 ∈ (Fil‘𝑋) → 𝑔 ⊆ 𝒫 𝑋)
4		velpw 4570	. . . . . . 7 ⊢ (𝑔 ∈ 𝒫 𝒫 𝑋 ↔ 𝑔 ⊆ 𝒫 𝑋)
5	3, 4	sylibr 237	. . . . . 6 ⊢ (𝑔 ∈ (Fil‘𝑋) → 𝑔 ∈ 𝒫 𝒫 𝑋)
6	5	a1d 26	. . . . 5 ⊢ (𝑔 ∈ (Fil‘𝑋) → (𝐹 ⊆ 𝑔 → 𝑔 ∈ 𝒫 𝒫 𝑋))
7	2, 6	mprgbir 3089	. . . 4 ⊢ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ⊆ 𝒫 𝒫 𝑋
8		ssnum 10034	. . . 4 ⊢ ((𝒫 𝒫 𝑋 ∈ dom card ∧ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ⊆ 𝒫 𝒫 𝑋) → {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∈ dom card)
9	1, 7, 8	sylancl 598	. . 3 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∈ dom card)
10		ssid 3962	. . . . . . 7 ⊢ 𝐹 ⊆ 𝐹
11	10	jctr 534	. . . . . 6 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝐹 ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ 𝐹))
12		sseq2 3966	. . . . . . 7 ⊢ (𝑔 = 𝐹 → (𝐹 ⊆ 𝑔 ↔ 𝐹 ⊆ 𝐹))
13	12	elrab 3653	. . . . . 6 ⊢ (𝐹 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ↔ (𝐹 ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ 𝐹))
14	11, 13	sylibr 237	. . . . 5 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔})
15	14	ne0d 4298	. . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ≠ ∅)
16	15	adantr 486	. . 3 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ≠ ∅)
17		sseq2 3966	. . . . . . 7 ⊢ (𝑔 = ∪ 𝑥 → (𝐹 ⊆ 𝑔 ↔ 𝐹 ⊆ ∪ 𝑥))
18		simpr1 1213	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥)) → 𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔})
19		ssrab 4028	. . . . . . . . . 10 ⊢ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ↔ (𝑥 ⊆ (Fil‘𝑋) ∧ ∀𝑔 ∈ 𝑥 𝐹 ⊆ 𝑔))
20	18, 19	sylib 221	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥)) → (𝑥 ⊆ (Fil‘𝑋) ∧ ∀𝑔 ∈ 𝑥 𝐹 ⊆ 𝑔))
21	20	simpld 500	. . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥)) → 𝑥 ⊆ (Fil‘𝑋))
22		simpr2 1214	. . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥)) → 𝑥 ≠ ∅)
23		simpr3 1215	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥)) → [⊊] Or 𝑥)
24		sorpssun 7733	. . . . . . . . . 10 ⊢ (( [⊊] Or 𝑥 ∧ (𝑔 ∈ 𝑥 ∧ ℎ ∈ 𝑥)) → (𝑔 ∪ ℎ) ∈ 𝑥)
25	24	ralrimivva 3211	. . . . . . . . 9 ⊢ ( [⊊] Or 𝑥 → ∀𝑔 ∈ 𝑥 ∀ℎ ∈ 𝑥 (𝑔 ∪ ℎ) ∈ 𝑥)
26	23, 25	syl 18	. . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥)) → ∀𝑔 ∈ 𝑥 ∀ℎ ∈ 𝑥 (𝑔 ∪ ℎ) ∈ 𝑥)
27		filuni 24057	. . . . . . . 8 ⊢ ((𝑥 ⊆ (Fil‘𝑋) ∧ 𝑥 ≠ ∅ ∧ ∀𝑔 ∈ 𝑥 ∀ℎ ∈ 𝑥 (𝑔 ∪ ℎ) ∈ 𝑥) → ∪ 𝑥 ∈ (Fil‘𝑋))
28	21, 22, 26, 27	syl3anc 1398	. . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥)) → ∪ 𝑥 ∈ (Fil‘𝑋))
29		n0 4310	. . . . . . . . 9 ⊢ (𝑥 ≠ ∅ ↔ ∃ℎ ℎ ∈ 𝑥)
30		ssel2 3935	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ ℎ ∈ 𝑥) → ℎ ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔})
31		sseq2 3966	. . . . . . . . . . . . . . 15 ⊢ (𝑔 = ℎ → (𝐹 ⊆ 𝑔 ↔ 𝐹 ⊆ ℎ))
32	31	elrab 3653	. . . . . . . . . . . . . 14 ⊢ (ℎ ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ↔ (ℎ ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ ℎ))
33	30, 32	sylib 221	. . . . . . . . . . . . 13 ⊢ ((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ ℎ ∈ 𝑥) → (ℎ ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ ℎ))
34	33	simprd 501	. . . . . . . . . . . 12 ⊢ ((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ ℎ ∈ 𝑥) → 𝐹 ⊆ ℎ)
35		ssuni 4901	. . . . . . . . . . . 12 ⊢ ((𝐹 ⊆ ℎ ∧ ℎ ∈ 𝑥) → 𝐹 ⊆ ∪ 𝑥)
36	34, 35	sylancom 600	. . . . . . . . . . 11 ⊢ ((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ ℎ ∈ 𝑥) → 𝐹 ⊆ ∪ 𝑥)
37	36	ex 418	. . . . . . . . . 10 ⊢ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} → (ℎ ∈ 𝑥 → 𝐹 ⊆ ∪ 𝑥))
38	37	exlimdv 1966	. . . . . . . . 9 ⊢ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} → (∃ℎ ℎ ∈ 𝑥 → 𝐹 ⊆ ∪ 𝑥))
39	29, 38	biimtrid 245	. . . . . . . 8 ⊢ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} → (𝑥 ≠ ∅ → 𝐹 ⊆ ∪ 𝑥))
40	18, 22, 39	sylc 66	. . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥)) → 𝐹 ⊆ ∪ 𝑥)
41	17, 28, 40	elrabd 3655	. . . . . 6 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ (𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥)) → ∪ 𝑥 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔})
42	41	ex 418	. . . . 5 ⊢ (𝐹 ∈ (Fil‘𝑋) → ((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥) → ∪ 𝑥 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔}))
43	42	alrimiv 1960	. . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → ∀𝑥((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥) → ∪ 𝑥 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔}))
44	43	adantr 486	. . 3 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → ∀𝑥((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥) → ∪ 𝑥 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔}))
45		zornn0g 10499	. . 3 ⊢ (({𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∈ dom card ∧ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ≠ ∅ ∧ ∀𝑥((𝑥 ⊆ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ 𝑥 ≠ ∅ ∧ [⊊] Or 𝑥) → ∪ 𝑥 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔})) → ∃𝑓 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔}∀ℎ ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ¬ 𝑓 ⊊ ℎ)
46	9, 16, 44, 45	syl3anc 1398	. 2 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → ∃𝑓 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔}∀ℎ ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ¬ 𝑓 ⊊ ℎ)
47		sseq2 3966	. . . . 5 ⊢ (𝑔 = 𝑓 → (𝐹 ⊆ 𝑔 ↔ 𝐹 ⊆ 𝑓))
48	47	elrab 3653	. . . 4 ⊢ (𝑓 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ↔ (𝑓 ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ 𝑓))
49	31	ralrab 3660	. . . 4 ⊢ (∀ℎ ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ¬ 𝑓 ⊊ ℎ ↔ ∀ℎ ∈ (Fil‘𝑋)(𝐹 ⊆ ℎ → ¬ 𝑓 ⊊ ℎ))
50		simpll 779	. . . . . 6 ⊢ (((𝑓 ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ 𝑓) ∧ ∀ℎ ∈ (Fil‘𝑋)(𝐹 ⊆ ℎ → ¬ 𝑓 ⊊ ℎ)) → 𝑓 ∈ (Fil‘𝑋))
51		sstr2 3947	. . . . . . . . . . 11 ⊢ (𝐹 ⊆ 𝑓 → (𝑓 ⊆ ℎ → 𝐹 ⊆ ℎ))
52	51	imim1d 83	. . . . . . . . . 10 ⊢ (𝐹 ⊆ 𝑓 → ((𝐹 ⊆ ℎ → ¬ 𝑓 ⊊ ℎ) → (𝑓 ⊆ ℎ → ¬ 𝑓 ⊊ ℎ)))
53		df-pss 3928	. . . . . . . . . . . . 13 ⊢ (𝑓 ⊊ ℎ ↔ (𝑓 ⊆ ℎ ∧ 𝑓 ≠ ℎ))
54	53	simplbi2 506	. . . . . . . . . . . 12 ⊢ (𝑓 ⊆ ℎ → (𝑓 ≠ ℎ → 𝑓 ⊊ ℎ))
55	54	necon1bd 2979	. . . . . . . . . . 11 ⊢ (𝑓 ⊆ ℎ → (¬ 𝑓 ⊊ ℎ → 𝑓 = ℎ))
56	55	a2i 15	. . . . . . . . . 10 ⊢ ((𝑓 ⊆ ℎ → ¬ 𝑓 ⊊ ℎ) → (𝑓 ⊆ ℎ → 𝑓 = ℎ))
57	52, 56	syl6 36	. . . . . . . . 9 ⊢ (𝐹 ⊆ 𝑓 → ((𝐹 ⊆ ℎ → ¬ 𝑓 ⊊ ℎ) → (𝑓 ⊆ ℎ → 𝑓 = ℎ)))
58	57	ralimdv 3182	. . . . . . . 8 ⊢ (𝐹 ⊆ 𝑓 → (∀ℎ ∈ (Fil‘𝑋)(𝐹 ⊆ ℎ → ¬ 𝑓 ⊊ ℎ) → ∀ℎ ∈ (Fil‘𝑋)(𝑓 ⊆ ℎ → 𝑓 = ℎ)))
59	58	imp 412	. . . . . . 7 ⊢ ((𝐹 ⊆ 𝑓 ∧ ∀ℎ ∈ (Fil‘𝑋)(𝐹 ⊆ ℎ → ¬ 𝑓 ⊊ ℎ)) → ∀ℎ ∈ (Fil‘𝑋)(𝑓 ⊆ ℎ → 𝑓 = ℎ))
60	59	adantll 727	. . . . . 6 ⊢ (((𝑓 ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ 𝑓) ∧ ∀ℎ ∈ (Fil‘𝑋)(𝐹 ⊆ ℎ → ¬ 𝑓 ⊊ ℎ)) → ∀ℎ ∈ (Fil‘𝑋)(𝑓 ⊆ ℎ → 𝑓 = ℎ))
61		isufil2 24080	. . . . . 6 ⊢ (𝑓 ∈ (UFil‘𝑋) ↔ (𝑓 ∈ (Fil‘𝑋) ∧ ∀ℎ ∈ (Fil‘𝑋)(𝑓 ⊆ ℎ → 𝑓 = ℎ)))
62	50, 60, 61	sylanbrc 595	. . . . 5 ⊢ (((𝑓 ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ 𝑓) ∧ ∀ℎ ∈ (Fil‘𝑋)(𝐹 ⊆ ℎ → ¬ 𝑓 ⊊ ℎ)) → 𝑓 ∈ (UFil‘𝑋))
63		simplr 781	. . . . 5 ⊢ (((𝑓 ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ 𝑓) ∧ ∀ℎ ∈ (Fil‘𝑋)(𝐹 ⊆ ℎ → ¬ 𝑓 ⊊ ℎ)) → 𝐹 ⊆ 𝑓)
64	62, 63	jca 521	. . . 4 ⊢ (((𝑓 ∈ (Fil‘𝑋) ∧ 𝐹 ⊆ 𝑓) ∧ ∀ℎ ∈ (Fil‘𝑋)(𝐹 ⊆ ℎ → ¬ 𝑓 ⊊ ℎ)) → (𝑓 ∈ (UFil‘𝑋) ∧ 𝐹 ⊆ 𝑓))
65	48, 49, 64	syl2anb 610	. . 3 ⊢ ((𝑓 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ∧ ∀ℎ ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ¬ 𝑓 ⊊ ℎ) → (𝑓 ∈ (UFil‘𝑋) ∧ 𝐹 ⊆ 𝑓))
66	65	reximi2 3101	. 2 ⊢ (∃𝑓 ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔}∀ℎ ∈ {𝑔 ∈ (Fil‘𝑋) ∣ 𝐹 ⊆ 𝑔} ¬ 𝑓 ⊊ ℎ → ∃𝑓 ∈ (UFil‘𝑋)𝐹 ⊆ 𝑓)
67	46, 66	syl 18	1 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝒫 𝒫 𝑋 ∈ dom card) → ∃𝑓 ∈ (UFil‘𝑋)𝐹 ⊆ 𝑓)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103  ∀wal 1568  ∃wex 1812   ∈ wcel 2146   ≠ wne 2961  ∀wral 3082  ∃wrex 3092  {crab 3419   ∪ cun 3906   ⊆ wss 3908   ⊊ wpss 3909  ∅c0 4289  𝒫 cpw 4565  ∪ cuni 4875   Or wor 5571  dom cdm 5664  ‘cfv 6540   [⊊] crpss 7725  cardccrd 9932  Filcfil 24017  UFilcufil 24071

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5241  ax-sep 5260  ax-nul 5272  ax-pow 5339  ax-pr 5407  ax-un 7738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4876  df-int 4916  df-iun 4961  df-br 5113  df-opab 5177  df-mpt 5196  df-tr 5222  df-id 5559  df-eprel 5564  df-po 5572  df-so 5573  df-fr 5617  df-se 5618  df-we 5619  df-xp 5670  df-rel 5671  df-cnv 5672  df-co 5673  df-dm 5674  df-rn 5675  df-res 5676  df-ima 5677  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-rpss 7726  df-om 7865  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-2o 8456  df-oadd 8459  df-er 8696  df-en 8946  df-dom 8947  df-fin 8949  df-fi 9373  df-dju 9898  df-card 9936  df-fbas 21534  df-fg 21535  df-fil 24018  df-ufil 24073

This theorem is used by:  filssufil  24084  numufl  24087