Theorem elfm3 24158

Description: An alternate formulation of elementhood in a mapping filter that requires 𝐹 to be onto. (Contributed by Jeff Hankins, 1-Oct-2009.) (Revised by Stefan O'Rear, 6-Aug-2015.)

Hypothesis

Ref	Expression
elfm2.l	⊢ 𝐿 = (𝑌filGen𝐵)

Assertion

Ref	Expression
elfm3	⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ ∃𝑥 ∈ 𝐿 𝐴 = (𝐹 “ 𝑥)))

Distinct variable groups:   𝑥,𝐵   𝑥,𝐹   𝑥,𝑋   𝑥,𝐴   𝑥,𝐿   𝑥,𝑌

Proof of Theorem elfm3

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		foima 6801	. . . 4 ⊢ (𝐹:𝑌–onto→𝑋 → (𝐹 “ 𝑌) = 𝑋)
2	1	adantl 487	. . 3 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → (𝐹 “ 𝑌) = 𝑋)
3		fofun 6797	. . . 4 ⊢ (𝐹:𝑌–onto→𝑋 → Fun 𝐹)
4		elfvdm 6919	. . . 4 ⊢ (𝐵 ∈ (fBas‘𝑌) → 𝑌 ∈ dom fBas)
5		funimaexg 6626	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝑌 ∈ dom fBas) → (𝐹 “ 𝑌) ∈ V)
6	3, 4, 5	syl2anr 609	. . 3 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → (𝐹 “ 𝑌) ∈ V)
7	2, 6	eqeltrrd 2866	. 2 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → 𝑋 ∈ V)
8		fof 6796	. . . . 5 ⊢ (𝐹:𝑌–onto→𝑋 → 𝐹:𝑌⟶𝑋)
9		elfm2.l	. . . . . 6 ⊢ 𝐿 = (𝑌filGen𝐵)
10	9	elfm2 24156	. . . . 5 ⊢ ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ 𝐿 (𝐹 “ 𝑦) ⊆ 𝐴)))
11	8, 10	syl3an3 1183	. . . 4 ⊢ ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ 𝐿 (𝐹 “ 𝑦) ⊆ 𝐴)))
12		fgcl 24086	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ (fBas‘𝑌) → (𝑌filGen𝐵) ∈ (Fil‘𝑌))
13	9, 12	eqeltrid 2869	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (fBas‘𝑌) → 𝐿 ∈ (Fil‘𝑌))
14	13	3ad2ant2 1152	. . . . . . . . . 10 ⊢ ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → 𝐿 ∈ (Fil‘𝑌))
15	14	ad2antrr 739	. . . . . . . . 9 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ (𝑦 ∈ 𝐿 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → 𝐿 ∈ (Fil‘𝑌))
16		simprl 783	. . . . . . . . 9 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ (𝑦 ∈ 𝐿 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → 𝑦 ∈ 𝐿)
17		cnvimass 6086	. . . . . . . . . . . 12 ⊢ (◡𝐹 “ 𝐴) ⊆ dom 𝐹
18		fofn 6798	. . . . . . . . . . . . 13 ⊢ (𝐹:𝑌–onto→𝑋 → 𝐹 Fn 𝑌)
19	18	fndmd 6644	. . . . . . . . . . . 12 ⊢ (𝐹:𝑌–onto→𝑋 → dom 𝐹 = 𝑌)
20	17, 19	sseqtrid 3980	. . . . . . . . . . 11 ⊢ (𝐹:𝑌–onto→𝑋 → (◡𝐹 “ 𝐴) ⊆ 𝑌)
21	20	3ad2ant3 1153	. . . . . . . . . 10 ⊢ ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → (◡𝐹 “ 𝐴) ⊆ 𝑌)
22	21	ad2antrr 739	. . . . . . . . 9 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ (𝑦 ∈ 𝐿 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → (◡𝐹 “ 𝐴) ⊆ 𝑌)
23	3	3ad2ant3 1153	. . . . . . . . . . . . 13 ⊢ ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → Fun 𝐹)
24	23	ad2antrr 739	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑦 ∈ 𝐿) → Fun 𝐹)
25	9	eleq2i 2857	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ 𝐿 ↔ 𝑦 ∈ (𝑌filGen𝐵))
26		elfg 24079	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 ∈ (fBas‘𝑌) → (𝑦 ∈ (𝑌filGen𝐵) ↔ (𝑦 ⊆ 𝑌 ∧ ∃𝑧 ∈ 𝐵 𝑧 ⊆ 𝑦)))
27	26	3ad2ant2 1152	. . . . . . . . . . . . . . . 16 ⊢ ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → (𝑦 ∈ (𝑌filGen𝐵) ↔ (𝑦 ⊆ 𝑌 ∧ ∃𝑧 ∈ 𝐵 𝑧 ⊆ 𝑦)))
28	27	adantr 486	. . . . . . . . . . . . . . 15 ⊢ (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝑦 ∈ (𝑌filGen𝐵) ↔ (𝑦 ⊆ 𝑌 ∧ ∃𝑧 ∈ 𝐵 𝑧 ⊆ 𝑦)))
29	25, 28	bitrid 286	. . . . . . . . . . . . . 14 ⊢ (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝑦 ∈ 𝐿 ↔ (𝑦 ⊆ 𝑌 ∧ ∃𝑧 ∈ 𝐵 𝑧 ⊆ 𝑦)))
30	29	simprbda 504	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑦 ∈ 𝐿) → 𝑦 ⊆ 𝑌)
31		sseq2 3964	. . . . . . . . . . . . . . . . 17 ⊢ (dom 𝐹 = 𝑌 → (𝑦 ⊆ dom 𝐹 ↔ 𝑦 ⊆ 𝑌))
32	31	biimpar 483	. . . . . . . . . . . . . . . 16 ⊢ ((dom 𝐹 = 𝑌 ∧ 𝑦 ⊆ 𝑌) → 𝑦 ⊆ dom 𝐹)
33	19, 32	sylan 592	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:𝑌–onto→𝑋 ∧ 𝑦 ⊆ 𝑌) → 𝑦 ⊆ dom 𝐹)
34	33	3ad2antl3 1206	. . . . . . . . . . . . . 14 ⊢ (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝑦 ⊆ 𝑌) → 𝑦 ⊆ dom 𝐹)
35	34	adantlr 728	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑦 ⊆ 𝑌) → 𝑦 ⊆ dom 𝐹)
36	30, 35	syldan 603	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑦 ∈ 𝐿) → 𝑦 ⊆ dom 𝐹)
37		funimass3 7053	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ 𝑦 ⊆ dom 𝐹) → ((𝐹 “ 𝑦) ⊆ 𝐴 ↔ 𝑦 ⊆ (◡𝐹 “ 𝐴)))
38	24, 36, 37	syl2anc 596	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑦 ∈ 𝐿) → ((𝐹 “ 𝑦) ⊆ 𝐴 ↔ 𝑦 ⊆ (◡𝐹 “ 𝐴)))
39	38	biimpd 232	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑦 ∈ 𝐿) → ((𝐹 “ 𝑦) ⊆ 𝐴 → 𝑦 ⊆ (◡𝐹 “ 𝐴)))
40	39	impr 460	. . . . . . . . 9 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ (𝑦 ∈ 𝐿 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → 𝑦 ⊆ (◡𝐹 “ 𝐴))
41		filss 24061	. . . . . . . . 9 ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ (𝑦 ∈ 𝐿 ∧ (◡𝐹 “ 𝐴) ⊆ 𝑌 ∧ 𝑦 ⊆ (◡𝐹 “ 𝐴))) → (◡𝐹 “ 𝐴) ∈ 𝐿)
42	15, 16, 22, 40, 41	syl13anc 1399	. . . . . . . 8 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ (𝑦 ∈ 𝐿 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → (◡𝐹 “ 𝐴) ∈ 𝐿)
43		foimacnv 6842	. . . . . . . . . . 11 ⊢ ((𝐹:𝑌–onto→𝑋 ∧ 𝐴 ⊆ 𝑋) → (𝐹 “ (◡𝐹 “ 𝐴)) = 𝐴)
44	43	eqcomd 2771	. . . . . . . . . 10 ⊢ ((𝐹:𝑌–onto→𝑋 ∧ 𝐴 ⊆ 𝑋) → 𝐴 = (𝐹 “ (◡𝐹 “ 𝐴)))
45	44	3ad2antl3 1206	. . . . . . . . 9 ⊢ (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐴 = (𝐹 “ (◡𝐹 “ 𝐴)))
46	45	adantr 486	. . . . . . . 8 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ (𝑦 ∈ 𝐿 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → 𝐴 = (𝐹 “ (◡𝐹 “ 𝐴)))
47		imaeq2 6060	. . . . . . . . 9 ⊢ (𝑥 = (◡𝐹 “ 𝐴) → (𝐹 “ 𝑥) = (𝐹 “ (◡𝐹 “ 𝐴)))
48	47	rspceeqv 3606	. . . . . . . 8 ⊢ (((◡𝐹 “ 𝐴) ∈ 𝐿 ∧ 𝐴 = (𝐹 “ (◡𝐹 “ 𝐴))) → ∃𝑥 ∈ 𝐿 𝐴 = (𝐹 “ 𝑥))
49	42, 46, 48	syl2anc 596	. . . . . . 7 ⊢ ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ (𝑦 ∈ 𝐿 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐿 𝐴 = (𝐹 “ 𝑥))
50	49	rexlimdvaa 3169	. . . . . 6 ⊢ (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ 𝐴 ⊆ 𝑋) → (∃𝑦 ∈ 𝐿 (𝐹 “ 𝑦) ⊆ 𝐴 → ∃𝑥 ∈ 𝐿 𝐴 = (𝐹 “ 𝑥)))
51	50	expimpd 459	. . . . 5 ⊢ ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → ((𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ 𝐿 (𝐹 “ 𝑦) ⊆ 𝐴) → ∃𝑥 ∈ 𝐿 𝐴 = (𝐹 “ 𝑥)))
52		simprr 785	. . . . . . . 8 ⊢ (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ (𝑥 ∈ 𝐿 ∧ 𝐴 = (𝐹 “ 𝑥))) → 𝐴 = (𝐹 “ 𝑥))
53		imassrn 6075	. . . . . . . . 9 ⊢ (𝐹 “ 𝑥) ⊆ ran 𝐹
54		forn 6799	. . . . . . . . . . 11 ⊢ (𝐹:𝑌–onto→𝑋 → ran 𝐹 = 𝑋)
55	54	3ad2ant3 1153	. . . . . . . . . 10 ⊢ ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → ran 𝐹 = 𝑋)
56	55	adantr 486	. . . . . . . . 9 ⊢ (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ (𝑥 ∈ 𝐿 ∧ 𝐴 = (𝐹 “ 𝑥))) → ran 𝐹 = 𝑋)
57	53, 56	sseqtrid 3980	. . . . . . . 8 ⊢ (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ (𝑥 ∈ 𝐿 ∧ 𝐴 = (𝐹 “ 𝑥))) → (𝐹 “ 𝑥) ⊆ 𝑋)
58	52, 57	eqsstrd 3972	. . . . . . 7 ⊢ (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ (𝑥 ∈ 𝐿 ∧ 𝐴 = (𝐹 “ 𝑥))) → 𝐴 ⊆ 𝑋)
59		eqimss2 3997	. . . . . . . . 9 ⊢ (𝐴 = (𝐹 “ 𝑥) → (𝐹 “ 𝑥) ⊆ 𝐴)
60		imaeq2 6060	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑥 → (𝐹 “ 𝑦) = (𝐹 “ 𝑥))
61	60	sseq1d 3969	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → ((𝐹 “ 𝑦) ⊆ 𝐴 ↔ (𝐹 “ 𝑥) ⊆ 𝐴))
62	61	rspcev 3583	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐿 ∧ (𝐹 “ 𝑥) ⊆ 𝐴) → ∃𝑦 ∈ 𝐿 (𝐹 “ 𝑦) ⊆ 𝐴)
63	59, 62	sylan2 605	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐿 ∧ 𝐴 = (𝐹 “ 𝑥)) → ∃𝑦 ∈ 𝐿 (𝐹 “ 𝑦) ⊆ 𝐴)
64	63	adantl 487	. . . . . . 7 ⊢ (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ (𝑥 ∈ 𝐿 ∧ 𝐴 = (𝐹 “ 𝑥))) → ∃𝑦 ∈ 𝐿 (𝐹 “ 𝑦) ⊆ 𝐴)
65	58, 64	jca 521	. . . . . 6 ⊢ (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) ∧ (𝑥 ∈ 𝐿 ∧ 𝐴 = (𝐹 “ 𝑥))) → (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ 𝐿 (𝐹 “ 𝑦) ⊆ 𝐴))
66	65	rexlimdvaa 3169	. . . . 5 ⊢ ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → (∃𝑥 ∈ 𝐿 𝐴 = (𝐹 “ 𝑥) → (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ 𝐿 (𝐹 “ 𝑦) ⊆ 𝐴)))
67	51, 66	impbid 215	. . . 4 ⊢ ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → ((𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ 𝐿 (𝐹 “ 𝑦) ⊆ 𝐴) ↔ ∃𝑥 ∈ 𝐿 𝐴 = (𝐹 “ 𝑥)))
68	11, 67	bitrd 282	. . 3 ⊢ ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ ∃𝑥 ∈ 𝐿 𝐴 = (𝐹 “ 𝑥)))
69	68	3coml 1145	. 2 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋 ∧ 𝑋 ∈ V) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ ∃𝑥 ∈ 𝐿 𝐴 = (𝐹 “ 𝑥)))
70	7, 69	mpd3an3 1491	1 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌–onto→𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ ∃𝑥 ∈ 𝐿 𝐴 = (𝐹 “ 𝑥)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∃wrex 3091  Vcvv 3457   ⊆ wss 3906  ^◡ccnv 5662  dom cdm 5663  ran crn 5664   “ cima 5666  Fun wfun 6534  ⟶wf 6536  –onto→wfo 6538  ‘cfv 6540  (class class class)co 7419  fBascfbas 21560  filGencfg 21561  Filcfil 24053   FilMap cfm 24141

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 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  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-ov 7422  df-oprab 7423  df-mpo 7424  df-fbas 21569  df-fg 21570  df-fil 24054  df-fm 24146

This theorem is used by:  fmid  24168