Theorem ushgredgedgloop 16047

Description: In a simple hypergraph there is a 1-1 onto mapping between the indexed edges being loops at a fixed vertex N and the set of loops at this vertex N. (Contributed by AV, 11-Dec-2020.) (Revised by AV, 6-Jul-2022.)

Hypotheses

Ref	Expression
ushgredgedgloop.e	|- E = (Edg ` G )
ushgredgedgloop.i	|- I = (iEdg ` G )
ushgredgedgloop.a	|- A = { i e. dom I | ( I ` i ) = { N } }
ushgredgedgloop.b	|- B = { e e. E | e = { N } }
ushgredgedgloop.f	|- F = ( x e. A |-> ( I ` x ) )

Assertion

Ref	Expression
ushgredgedgloop	|- ( ( G e. USHGraph /\ N e. V ) -> F : A -1-1-onto-> B )

Distinct variable groups:   B, e   e, E, i   e, G, i, x   e, I, i, x   e, N, i, x   e, V, i, x

Allowed substitution hints:   A( x, e, i)   B( x, i)   E( x)   F( x, e, i)

Proof of Theorem ushgredgedgloop

Dummy variables f j p w are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2229	. . . . 5 |- (Vtx ` G ) = (Vtx ` G )
2		ushgredgedgloop.i	. . . . 5 |- I = (iEdg ` G )
3	1, 2	ushgrfm 15895	. . . 4 |- ( G e. USHGraph -> I : dom I -1-1-> { p e. ~P (Vtx ` G ) | E. w w e. p } )
4	3	adantr 276	. . 3 |- ( ( G e. USHGraph /\ N e. V ) -> I : dom I -1-1-> { p e. ~P (Vtx ` G ) | E. w w e. p } )
5		ssrab2 3309	. . 3 |- { i e. dom I | ( I ` i ) = { N } } C_ dom I
6		f1ores 5592	. . 3 |- ( ( I : dom I -1-1-> { p e. ~P (Vtx ` G ) | E. w w e. p } /\ { i e. dom I | ( I ` i ) = { N } } C_ dom I ) -> ( I |` { i e. dom I | ( I ` i ) = { N } } ) : { i e. dom I | ( I ` i ) = { N } } -1-1-onto-> ( I " { i e. dom I | ( I ` i ) = { N } } ) )
7	4, 5, 6	sylancl 413	. 2 |- ( ( G e. USHGraph /\ N e. V ) -> ( I |` { i e. dom I | ( I ` i ) = { N } } ) : { i e. dom I | ( I ` i ) = { N } } -1-1-onto-> ( I " { i e. dom I | ( I ` i ) = { N } } ) )
8		ushgredgedgloop.f	. . . . 5 |- F = ( x e. A |-> ( I ` x ) )
9		ushgredgedgloop.a	. . . . . . 7 |- A = { i e. dom I | ( I ` i ) = { N } }
10	9	a1i 9	. . . . . 6 |- ( ( G e. USHGraph /\ N e. V ) -> A = { i e. dom I | ( I ` i ) = { N } } )
11		eqidd 2230	. . . . . 6 |- ( ( ( G e. USHGraph /\ N e. V ) /\ x e. A ) -> ( I ` x ) = ( I ` x ) )
12	10, 11	mpteq12dva 4165	. . . . 5 |- ( ( G e. USHGraph /\ N e. V ) -> ( x e. A |-> ( I ` x ) ) = ( x e. { i e. dom I | ( I ` i ) = { N } } |-> ( I ` x ) ) )
13	8, 12	eqtrid 2274	. . . 4 |- ( ( G e. USHGraph /\ N e. V ) -> F = ( x e. { i e. dom I | ( I ` i ) = { N } } |-> ( I ` x ) ) )
14		f1f 5536	. . . . . . 7 |- ( I : dom I -1-1-> { p e. ~P (Vtx ` G ) | E. w w e. p } -> I : dom I --> { p e. ~P (Vtx ` G ) | E. w w e. p } )
15	3, 14	syl 14	. . . . . 6 |- ( G e. USHGraph -> I : dom I --> { p e. ~P (Vtx ` G ) | E. w w e. p } )
16	5	a1i 9	. . . . . 6 |- ( G e. USHGraph -> { i e. dom I | ( I ` i ) = { N } } C_ dom I )
17	15, 16	feqresmpt 5693	. . . . 5 |- ( G e. USHGraph -> ( I |` { i e. dom I | ( I ` i ) = { N } } ) = ( x e. { i e. dom I | ( I ` i ) = { N } } |-> ( I ` x ) ) )
18	17	adantr 276	. . . 4 |- ( ( G e. USHGraph /\ N e. V ) -> ( I |` { i e. dom I | ( I ` i ) = { N } } ) = ( x e. { i e. dom I | ( I ` i ) = { N } } |-> ( I ` x ) ) )
19	13, 18	eqtr4d 2265	. . 3 |- ( ( G e. USHGraph /\ N e. V ) -> F = ( I |` { i e. dom I | ( I ` i ) = { N } } ) )
20		ushgruhgr 15901	. . . . . . . 8 |- ( G e. USHGraph -> G e. UHGraph )
21		eqid 2229	. . . . . . . . 9 |- (iEdg ` G ) = (iEdg ` G )
22	21	uhgrfun 15898	. . . . . . . 8 |- ( G e. UHGraph -> Fun (iEdg ` G ) )
23	20, 22	syl 14	. . . . . . 7 |- ( G e. USHGraph -> Fun (iEdg ` G ) )
24	2	funeqi 5342	. . . . . . 7 |- ( Fun I <-> Fun (iEdg ` G ) )
25	23, 24	sylibr 134	. . . . . 6 |- ( G e. USHGraph -> Fun I )
26	25	adantr 276	. . . . 5 |- ( ( G e. USHGraph /\ N e. V ) -> Fun I )
27		dfimafn 5687	. . . . 5 |- ( ( Fun I /\ { i e. dom I | ( I ` i ) = { N } } C_ dom I ) -> ( I " { i e. dom I | ( I ` i ) = { N } } ) = { e | E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = e } )
28	26, 5, 27	sylancl 413	. . . 4 |- ( ( G e. USHGraph /\ N e. V ) -> ( I " { i e. dom I | ( I ` i ) = { N } } ) = { e | E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = e } )
29		fveqeq2 5641	. . . . . . . . . 10 |- ( i = j -> ( ( I ` i ) = { N } <-> ( I ` j ) = { N } ) )
30	29	elrab 2959	. . . . . . . . 9 |- ( j e. { i e. dom I | ( I ` i ) = { N } } <-> ( j e. dom I /\ ( I ` j ) = { N } ) )
31		simpl 109	. . . . . . . . . . . . . . 15 |- ( ( j e. dom I /\ ( I ` j ) = { N } ) -> j e. dom I )
32		fvelrn 5771	. . . . . . . . . . . . . . . 16 |- ( ( Fun I /\ j e. dom I ) -> ( I ` j ) e. ran I )
33	2	eqcomi 2233	. . . . . . . . . . . . . . . . 17 |- (iEdg ` G ) = I
34	33	rneqi 4955	. . . . . . . . . . . . . . . 16 |- ran (iEdg ` G ) = ran I
35	32, 34	eleqtrrdi 2323	. . . . . . . . . . . . . . 15 |- ( ( Fun I /\ j e. dom I ) -> ( I ` j ) e. ran (iEdg ` G ) )
36	26, 31, 35	syl2an 289	. . . . . . . . . . . . . 14 |- ( ( ( G e. USHGraph /\ N e. V ) /\ ( j e. dom I /\ ( I ` j ) = { N } ) ) -> ( I ` j ) e. ran (iEdg ` G ) )
37	36	3adant3 1041	. . . . . . . . . . . . 13 |- ( ( ( G e. USHGraph /\ N e. V ) /\ ( j e. dom I /\ ( I ` j ) = { N } ) /\ ( I ` j ) = f ) -> ( I ` j ) e. ran (iEdg ` G ) )
38		eleq1 2292	. . . . . . . . . . . . . . 15 |- ( f = ( I ` j ) -> ( f e. ran (iEdg ` G ) <-> ( I ` j ) e. ran (iEdg ` G ) ) )
39	38	eqcoms 2232	. . . . . . . . . . . . . 14 |- ( ( I ` j ) = f -> ( f e. ran (iEdg ` G ) <-> ( I ` j ) e. ran (iEdg ` G ) ) )
40	39	3ad2ant3 1044	. . . . . . . . . . . . 13 |- ( ( ( G e. USHGraph /\ N e. V ) /\ ( j e. dom I /\ ( I ` j ) = { N } ) /\ ( I ` j ) = f ) -> ( f e. ran (iEdg ` G ) <-> ( I ` j ) e. ran (iEdg ` G ) ) )
41	37, 40	mpbird 167	. . . . . . . . . . . 12 |- ( ( ( G e. USHGraph /\ N e. V ) /\ ( j e. dom I /\ ( I ` j ) = { N } ) /\ ( I ` j ) = f ) -> f e. ran (iEdg ` G ) )
42		ushgredgedgloop.e	. . . . . . . . . . . . . . . 16 |- E = (Edg ` G )
43		edgvalg 15881	. . . . . . . . . . . . . . . 16 |- ( G e. USHGraph -> (Edg ` G ) = ran (iEdg ` G ) )
44	42, 43	eqtrid 2274	. . . . . . . . . . . . . . 15 |- ( G e. USHGraph -> E = ran (iEdg ` G ) )
45	44	eleq2d 2299	. . . . . . . . . . . . . 14 |- ( G e. USHGraph -> ( f e. E <-> f e. ran (iEdg ` G ) ) )
46	45	adantr 276	. . . . . . . . . . . . 13 |- ( ( G e. USHGraph /\ N e. V ) -> ( f e. E <-> f e. ran (iEdg ` G ) ) )
47	46	3ad2ant1 1042	. . . . . . . . . . . 12 |- ( ( ( G e. USHGraph /\ N e. V ) /\ ( j e. dom I /\ ( I ` j ) = { N } ) /\ ( I ` j ) = f ) -> ( f e. E <-> f e. ran (iEdg ` G ) ) )
48	41, 47	mpbird 167	. . . . . . . . . . 11 |- ( ( ( G e. USHGraph /\ N e. V ) /\ ( j e. dom I /\ ( I ` j ) = { N } ) /\ ( I ` j ) = f ) -> f e. E )
49		eqeq1 2236	. . . . . . . . . . . . . . 15 |- ( ( I ` j ) = f -> ( ( I ` j ) = { N } <-> f = { N } ) )
50	49	biimpcd 159	. . . . . . . . . . . . . 14 |- ( ( I ` j ) = { N } -> ( ( I ` j ) = f -> f = { N } ) )
51	50	adantl 277	. . . . . . . . . . . . 13 |- ( ( j e. dom I /\ ( I ` j ) = { N } ) -> ( ( I ` j ) = f -> f = { N } ) )
52	51	a1i 9	. . . . . . . . . . . 12 |- ( ( G e. USHGraph /\ N e. V ) -> ( ( j e. dom I /\ ( I ` j ) = { N } ) -> ( ( I ` j ) = f -> f = { N } ) ) )
53	52	3imp 1217	. . . . . . . . . . 11 |- ( ( ( G e. USHGraph /\ N e. V ) /\ ( j e. dom I /\ ( I ` j ) = { N } ) /\ ( I ` j ) = f ) -> f = { N } )
54	48, 53	jca 306	. . . . . . . . . 10 |- ( ( ( G e. USHGraph /\ N e. V ) /\ ( j e. dom I /\ ( I ` j ) = { N } ) /\ ( I ` j ) = f ) -> ( f e. E /\ f = { N } ) )
55	54	3exp 1226	. . . . . . . . 9 |- ( ( G e. USHGraph /\ N e. V ) -> ( ( j e. dom I /\ ( I ` j ) = { N } ) -> ( ( I ` j ) = f -> ( f e. E /\ f = { N } ) ) ) )
56	30, 55	biimtrid 152	. . . . . . . 8 |- ( ( G e. USHGraph /\ N e. V ) -> ( j e. { i e. dom I | ( I ` i ) = { N } } -> ( ( I ` j ) = f -> ( f e. E /\ f = { N } ) ) ) )
57	56	rexlimdv 2647	. . . . . . 7 |- ( ( G e. USHGraph /\ N e. V ) -> ( E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = f -> ( f e. E /\ f = { N } ) ) )
58	23	funfnd 5352	. . . . . . . . . . . 12 |- ( G e. USHGraph -> (iEdg ` G ) Fn dom (iEdg ` G ) )
59		fvelrnb 5686	. . . . . . . . . . . 12 |- ( (iEdg ` G ) Fn dom (iEdg ` G ) -> ( f e. ran (iEdg ` G ) <-> E. j e. dom (iEdg ` G ) ( (iEdg ` G ) ` j ) = f ) )
60	58, 59	syl 14	. . . . . . . . . . 11 |- ( G e. USHGraph -> ( f e. ran (iEdg ` G ) <-> E. j e. dom (iEdg ` G ) ( (iEdg ` G ) ` j ) = f ) )
61	33	dmeqi 4927	. . . . . . . . . . . . . . . . . . . . . 22 |- dom (iEdg ` G ) = dom I
62	61	eleq2i 2296	. . . . . . . . . . . . . . . . . . . . 21 |- ( j e. dom (iEdg ` G ) <-> j e. dom I )
63	62	biimpi 120	. . . . . . . . . . . . . . . . . . . 20 |- ( j e. dom (iEdg ` G ) -> j e. dom I )
64	63	adantr 276	. . . . . . . . . . . . . . . . . . 19 |- ( ( j e. dom (iEdg ` G ) /\ ( (iEdg ` G ) ` j ) = f ) -> j e. dom I )
65	64	adantl 277	. . . . . . . . . . . . . . . . . 18 |- ( ( ( G e. USHGraph /\ f = { N } ) /\ ( j e. dom (iEdg ` G ) /\ ( (iEdg ` G ) ` j ) = f ) ) -> j e. dom I )
66	33	fveq1i 5633	. . . . . . . . . . . . . . . . . . . . . . . . . 26 |- ( (iEdg ` G ) ` j ) = ( I ` j )
67	66	eqeq2i 2240	. . . . . . . . . . . . . . . . . . . . . . . . 25 |- ( f = ( (iEdg ` G ) ` j ) <-> f = ( I ` j ) )
68	67	biimpi 120	. . . . . . . . . . . . . . . . . . . . . . . 24 |- ( f = ( (iEdg ` G ) ` j ) -> f = ( I ` j ) )
69	68	eqcoms 2232	. . . . . . . . . . . . . . . . . . . . . . 23 |- ( ( (iEdg ` G ) ` j ) = f -> f = ( I ` j ) )
70	69	eqeq1d 2238	. . . . . . . . . . . . . . . . . . . . . 22 |- ( ( (iEdg ` G ) ` j ) = f -> ( f = { N } <-> ( I ` j ) = { N } ) )
71	70	biimpcd 159	. . . . . . . . . . . . . . . . . . . . 21 |- ( f = { N } -> ( ( (iEdg ` G ) ` j ) = f -> ( I ` j ) = { N } ) )
72	71	adantl 277	. . . . . . . . . . . . . . . . . . . 20 |- ( ( G e. USHGraph /\ f = { N } ) -> ( ( (iEdg ` G ) ` j ) = f -> ( I ` j ) = { N } ) )
73	72	adantld 278	. . . . . . . . . . . . . . . . . . 19 |- ( ( G e. USHGraph /\ f = { N } ) -> ( ( j e. dom (iEdg ` G ) /\ ( (iEdg ` G ) ` j ) = f ) -> ( I ` j ) = { N } ) )
74	73	imp 124	. . . . . . . . . . . . . . . . . 18 |- ( ( ( G e. USHGraph /\ f = { N } ) /\ ( j e. dom (iEdg ` G ) /\ ( (iEdg ` G ) ` j ) = f ) ) -> ( I ` j ) = { N } )
75	65, 74	jca 306	. . . . . . . . . . . . . . . . 17 |- ( ( ( G e. USHGraph /\ f = { N } ) /\ ( j e. dom (iEdg ` G ) /\ ( (iEdg ` G ) ` j ) = f ) ) -> ( j e. dom I /\ ( I ` j ) = { N } ) )
76	75, 30	sylibr 134	. . . . . . . . . . . . . . . 16 |- ( ( ( G e. USHGraph /\ f = { N } ) /\ ( j e. dom (iEdg ` G ) /\ ( (iEdg ` G ) ` j ) = f ) ) -> j e. { i e. dom I | ( I ` i ) = { N } } )
77	66	eqeq1i 2237	. . . . . . . . . . . . . . . . . . 19 |- ( ( (iEdg ` G ) ` j ) = f <-> ( I ` j ) = f )
78	77	biimpi 120	. . . . . . . . . . . . . . . . . 18 |- ( ( (iEdg ` G ) ` j ) = f -> ( I ` j ) = f )
79	78	adantl 277	. . . . . . . . . . . . . . . . 17 |- ( ( j e. dom (iEdg ` G ) /\ ( (iEdg ` G ) ` j ) = f ) -> ( I ` j ) = f )
80	79	adantl 277	. . . . . . . . . . . . . . . 16 |- ( ( ( G e. USHGraph /\ f = { N } ) /\ ( j e. dom (iEdg ` G ) /\ ( (iEdg ` G ) ` j ) = f ) ) -> ( I ` j ) = f )
81	76, 80	jca 306	. . . . . . . . . . . . . . 15 |- ( ( ( G e. USHGraph /\ f = { N } ) /\ ( j e. dom (iEdg ` G ) /\ ( (iEdg ` G ) ` j ) = f ) ) -> ( j e. { i e. dom I | ( I ` i ) = { N } } /\ ( I ` j ) = f ) )
82	81	ex 115	. . . . . . . . . . . . . 14 |- ( ( G e. USHGraph /\ f = { N } ) -> ( ( j e. dom (iEdg ` G ) /\ ( (iEdg ` G ) ` j ) = f ) -> ( j e. { i e. dom I | ( I ` i ) = { N } } /\ ( I ` j ) = f ) ) )
83	82	reximdv2 2629	. . . . . . . . . . . . 13 |- ( ( G e. USHGraph /\ f = { N } ) -> ( E. j e. dom (iEdg ` G ) ( (iEdg ` G ) ` j ) = f -> E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = f ) )
84	83	ex 115	. . . . . . . . . . . 12 |- ( G e. USHGraph -> ( f = { N } -> ( E. j e. dom (iEdg ` G ) ( (iEdg ` G ) ` j ) = f -> E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = f ) ) )
85	84	com23 78	. . . . . . . . . . 11 |- ( G e. USHGraph -> ( E. j e. dom (iEdg ` G ) ( (iEdg ` G ) ` j ) = f -> ( f = { N } -> E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = f ) ) )
86	60, 85	sylbid 150	. . . . . . . . . 10 |- ( G e. USHGraph -> ( f e. ran (iEdg ` G ) -> ( f = { N } -> E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = f ) ) )
87	45, 86	sylbid 150	. . . . . . . . 9 |- ( G e. USHGraph -> ( f e. E -> ( f = { N } -> E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = f ) ) )
88	87	impd 254	. . . . . . . 8 |- ( G e. USHGraph -> ( ( f e. E /\ f = { N } ) -> E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = f ) )
89	88	adantr 276	. . . . . . 7 |- ( ( G e. USHGraph /\ N e. V ) -> ( ( f e. E /\ f = { N } ) -> E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = f ) )
90	57, 89	impbid 129	. . . . . 6 |- ( ( G e. USHGraph /\ N e. V ) -> ( E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = f <-> ( f e. E /\ f = { N } ) ) )
91		vex 2802	. . . . . . 7 |- f e. _V
92		eqeq2 2239	. . . . . . . 8 |- ( e = f -> ( ( I ` j ) = e <-> ( I ` j ) = f ) )
93	92	rexbidv 2531	. . . . . . 7 |- ( e = f -> ( E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = e <-> E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = f ) )
94	91, 93	elab 2947	. . . . . 6 |- ( f e. { e | E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = e } <-> E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = f )
95		eqeq1 2236	. . . . . . 7 |- ( e = f -> ( e = { N } <-> f = { N } ) )
96		ushgredgedgloop.b	. . . . . . 7 |- B = { e e. E | e = { N } }
97	95, 96	elrab2 2962	. . . . . 6 |- ( f e. B <-> ( f e. E /\ f = { N } ) )
98	90, 94, 97	3bitr4g 223	. . . . 5 |- ( ( G e. USHGraph /\ N e. V ) -> ( f e. { e | E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = e } <-> f e. B ) )
99	98	eqrdv 2227	. . . 4 |- ( ( G e. USHGraph /\ N e. V ) -> { e | E. j e. { i e. dom I | ( I ` i ) = { N } } ( I ` j ) = e } = B )
100	28, 99	eqtr2d 2263	. . 3 |- ( ( G e. USHGraph /\ N e. V ) -> B = ( I " { i e. dom I | ( I ` i ) = { N } } ) )
101	19, 10, 100	f1oeq123d 5571	. 2 |- ( ( G e. USHGraph /\ N e. V ) -> ( F : A -1-1-onto-> B <-> ( I |` { i e. dom I | ( I ` i ) = { N } } ) : { i e. dom I | ( I ` i ) = { N } } -1-1-onto-> ( I " { i e. dom I | ( I ` i ) = { N } } ) ) )
102	7, 101	mpbird 167	1 |- ( ( G e. USHGraph /\ N e. V ) -> F : A -1-1-onto-> B )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1002   = wceq 1395   E.wex 1538   e. wcel 2200   {cab 2215   E.wrex 2509   {crab 2512   C_ wss 3197   ~Pcpw 3649   {csn 3666   |-> cmpt 4145   dom cdm 4720   ran crn 4721   |` cres 4722   "cima 4723   Fun wfun 5315   Fn wfn 5316   -->wf 5317   -1-1->wf1 5318   -1-1-onto->wf1o 5320   ` cfv 5321  Vtxcvtx 15834  iEdgciedg 15835  Edgcedg 15879  UHGraphcuhgr 15888  USHGraphcushgr 15889

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-cnex 8106  ax-resscn 8107  ax-1cn 8108  ax-1re 8109  ax-icn 8110  ax-addcl 8111  ax-addrcl 8112  ax-mulcl 8113  ax-addcom 8115  ax-mulcom 8116  ax-addass 8117  ax-mulass 8118  ax-distr 8119  ax-i2m1 8120  ax-1rid 8122  ax-0id 8123  ax-rnegex 8124  ax-cnre 8126

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4385  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-sub 8335  df-inn 9127  df-2 9185  df-3 9186  df-4 9187  df-5 9188  df-6 9189  df-7 9190  df-8 9191  df-9 9192  df-n0 9386  df-dec 9595  df-ndx 13056  df-slot 13057  df-base 13059  df-edgf 15827  df-vtx 15836  df-iedg 15837  df-edg 15880  df-uhgrm 15890  df-ushgrm 15891

This theorem is referenced by:  vtxduspgrfvedgfi  16087