Theorem ushgredgedgloop 16108

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 2230	. . . . 5 |- (Vtx ` G ) = (Vtx ` G )
2		ushgredgedgloop.i	. . . . 5 |- I = (iEdg ` G )
3	1, 2	ushgrfm 15954	. . . 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 3311	. . 3 |- { i e. dom I | ( I ` i ) = { N } } C_ dom I
6		f1ores 5601	. . 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 2231	. . . . . 6 |- ( ( ( G e. USHGraph /\ N e. V ) /\ x e. A ) -> ( I ` x ) = ( I ` x ) )
12	10, 11	mpteq12dva 4171	. . . . 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 2275	. . . 4 |- ( ( G e. USHGraph /\ N e. V ) -> F = ( x e. { i e. dom I | ( I ` i ) = { N } } |-> ( I ` x ) ) )
14		f1f 5545	. . . . . . 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 5703	. . . . 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 2266	. . 3 |- ( ( G e. USHGraph /\ N e. V ) -> F = ( I |` { i e. dom I | ( I ` i ) = { N } } ) )
20		ushgruhgr 15960	. . . . . . . 8 |- ( G e. USHGraph -> G e. UHGraph )
21		eqid 2230	. . . . . . . . 9 |- (iEdg ` G ) = (iEdg ` G )
22	21	uhgrfun 15957	. . . . . . . 8 |- ( G e. UHGraph -> Fun (iEdg ` G ) )
23	20, 22	syl 14	. . . . . . 7 |- ( G e. USHGraph -> Fun (iEdg ` G ) )
24	2	funeqi 5349	. . . . . . 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 5697	. . . . 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 5651	. . . . . . . . . 10 |- ( i = j -> ( ( I ` i ) = { N } <-> ( I ` j ) = { N } ) )
30	29	elrab 2961	. . . . . . . . 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 5781	. . . . . . . . . . . . . . . 16 |- ( ( Fun I /\ j e. dom I ) -> ( I ` j ) e. ran I )
33	2	eqcomi 2234	. . . . . . . . . . . . . . . . 17 |- (iEdg ` G ) = I
34	33	rneqi 4962	. . . . . . . . . . . . . . . 16 |- ran (iEdg ` G ) = ran I
35	32, 34	eleqtrrdi 2324	. . . . . . . . . . . . . . 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 1043	. . . . . . . . . . . . 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 2293	. . . . . . . . . . . . . . 15 |- ( f = ( I ` j ) -> ( f e. ran (iEdg ` G ) <-> ( I ` j ) e. ran (iEdg ` G ) ) )
39	38	eqcoms 2233	. . . . . . . . . . . . . 14 |- ( ( I ` j ) = f -> ( f e. ran (iEdg ` G ) <-> ( I ` j ) e. ran (iEdg ` G ) ) )
40	39	3ad2ant3 1046	. . . . . . . . . . . . 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 15939	. . . . . . . . . . . . . . . 16 |- ( G e. USHGraph -> (Edg ` G ) = ran (iEdg ` G ) )
44	42, 43	eqtrid 2275	. . . . . . . . . . . . . . 15 |- ( G e. USHGraph -> E = ran (iEdg ` G ) )
45	44	eleq2d 2300	. . . . . . . . . . . . . 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 1044	. . . . . . . . . . . 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 2237	. . . . . . . . . . . . . . 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 1219	. . . . . . . . . . 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 1228	. . . . . . . . 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 2648	. . . . . . 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 5359	. . . . . . . . . . . 12 |- ( G e. USHGraph -> (iEdg ` G ) Fn dom (iEdg ` G ) )
59		fvelrnb 5696	. . . . . . . . . . . 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 4934	. . . . . . . . . . . . . . . . . . . . . 22 |- dom (iEdg ` G ) = dom I
62	61	eleq2i 2297	. . . . . . . . . . . . . . . . . . . . 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 5643	. . . . . . . . . . . . . . . . . . . . . . . . . 26 |- ( (iEdg ` G ) ` j ) = ( I ` j )
67	66	eqeq2i 2241	. . . . . . . . . . . . . . . . . . . . . . . . 25 |- ( f = ( (iEdg ` G ) ` j ) <-> f = ( I ` j ) )
68	67	biimpi 120	. . . . . . . . . . . . . . . . . . . . . . . 24 |- ( f = ( (iEdg ` G ) ` j ) -> f = ( I ` j ) )
69	68	eqcoms 2233	. . . . . . . . . . . . . . . . . . . . . . 23 |- ( ( (iEdg ` G ) ` j ) = f -> f = ( I ` j ) )
70	69	eqeq1d 2239	. . . . . . . . . . . . . . . . . . . . . 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 2238	. . . . . . . . . . . . . . . . . . 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 2630	. . . . . . . . . . . . 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 2804	. . . . . . 7 |- f e. _V
92		eqeq2 2240	. . . . . . . 8 |- ( e = f -> ( ( I ` j ) = e <-> ( I ` j ) = f ) )
93	92	rexbidv 2532	. . . . . . 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 2949	. . . . . 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 2237	. . . . . . 7 |- ( e = f -> ( e = { N } <-> f = { N } ) )
96		ushgredgedgloop.b	. . . . . . 7 |- B = { e e. E | e = { N } }
97	95, 96	elrab2 2964	. . . . . 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 2228	. . . 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 2264	. . 3 |- ( ( G e. USHGraph /\ N e. V ) -> B = ( I " { i e. dom I | ( I ` i ) = { N } } ) )
101	19, 10, 100	f1oeq123d 5580	. 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 1004   = wceq 1397   E.wex 1540   e. wcel 2201   {cab 2216   E.wrex 2510   {crab 2513   C_ wss 3199   ~Pcpw 3653   {csn 3670   |-> cmpt 4151   dom cdm 4727   ran crn 4728   |` cres 4729   "cima 4730   Fun wfun 5322   Fn wfn 5323   -->wf 5324   -1-1->wf1 5325   -1-1-onto->wf1o 5327   ` cfv 5328  Vtxcvtx 15892  iEdgciedg 15893  Edgcedg 15937  UHGraphcuhgr 15947  USHGraphcushgr 15948

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-cnex 8128  ax-resscn 8129  ax-1cn 8130  ax-1re 8131  ax-icn 8132  ax-addcl 8133  ax-addrcl 8134  ax-mulcl 8135  ax-addcom 8137  ax-mulcom 8138  ax-addass 8139  ax-mulass 8140  ax-distr 8141  ax-i2m1 8142  ax-1rid 8144  ax-0id 8145  ax-rnegex 8146  ax-cnre 8148

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-if 3605  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-riota 5976  df-ov 6026  df-oprab 6027  df-mpo 6028  df-1st 6308  df-2nd 6309  df-sub 8357  df-inn 9149  df-2 9207  df-3 9208  df-4 9209  df-5 9210  df-6 9211  df-7 9212  df-8 9213  df-9 9214  df-n0 9408  df-dec 9617  df-ndx 13108  df-slot 13109  df-base 13111  df-edgf 15885  df-vtx 15894  df-iedg 15895  df-edg 15938  df-uhgrm 15949  df-ushgrm 15950

This theorem is referenced by:  vtxduspgrfvedgfi  16181