Theorem usgredg2v 16477

Description: In a simple graph, the mapping of edges having a fixed endpoint to the other vertex of the edge is a one-to-one function into the set of vertices. (Contributed by Alexander van der Vekens, 4-Jan-2018.) (Revised by AV, 18-Oct-2020.)

Hypotheses

Ref	Expression
usgredg2v.v	⊢ 𝑉 = (Vtx‘𝐺)
usgredg2v.e	⊢ 𝐸 = (iEdg‘𝐺)
usgredg2v.a	⊢ 𝐴 = {𝑥 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑥)}
usgredg2v.f	⊢ 𝐹 = (𝑦 ∈ 𝐴 ↦ (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}))

Assertion

Ref	Expression
usgredg2v	⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → 𝐹:𝐴–1-1→𝑉)

Distinct variable groups:   𝑥,𝐸,𝑧   𝑧,𝐺   𝑥,𝑁,𝑧   𝑧,𝑉   𝑦,𝐴   𝑦,𝐸,𝑥,𝑧   𝑦,𝐺   𝑦,𝑁   𝑦,𝑉

Allowed substitution hints:   𝐴(𝑥, 𝑧)   𝐹(𝑥, 𝑦, 𝑧)   𝐺(𝑥)   𝑉(𝑥)

Proof of Theorem usgredg2v

Dummy variables 𝑤 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		usgredg2v.v	. . . . 5 ⊢ 𝑉 = (Vtx‘𝐺)
2		usgredg2v.e	. . . . 5 ⊢ 𝐸 = (iEdg‘𝐺)
3		usgredg2v.a	. . . . 5 ⊢ 𝐴 = {𝑥 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑥)}
4	1, 2, 3	usgredg2vlem1 16475	. . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝑦 ∈ 𝐴) → (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) ∈ 𝑉)
5	4	ralrimiva 2623	. . 3 ⊢ (𝐺 ∈ USGraph → ∀𝑦 ∈ 𝐴 (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) ∈ 𝑉)
6	5	adantr 276	. 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → ∀𝑦 ∈ 𝐴 (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) ∈ 𝑉)
7		simpr 110	. . . . . . . 8 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁})) → (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁}))
8		preq1 3788	. . . . . . . . . 10 ⊢ (𝑢 = 𝑧 → {𝑢, 𝑁} = {𝑧, 𝑁})
9	8	eqeq2d 2250	. . . . . . . . 9 ⊢ (𝑢 = 𝑧 → ((𝐸‘𝑦) = {𝑢, 𝑁} ↔ (𝐸‘𝑦) = {𝑧, 𝑁}))
10	9	cbvriotavw 6049	. . . . . . . 8 ⊢ (℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁})
11	8	eqeq2d 2250	. . . . . . . . 9 ⊢ (𝑢 = 𝑧 → ((𝐸‘𝑤) = {𝑢, 𝑁} ↔ (𝐸‘𝑤) = {𝑧, 𝑁}))
12	11	cbvriotavw 6049	. . . . . . . 8 ⊢ (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁})
13	7, 10, 12	3eqtr4g 2296	. . . . . . 7 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁})) → (℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}))
14		eqid 2238	. . . . . . 7 ⊢ 𝑁 = 𝑁
15	13, 14	jctir 313	. . . . . 6 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁})) → ((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) ∧ 𝑁 = 𝑁))
16	15	orcd 745	. . . . 5 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁})) → (((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) ∧ 𝑁 = 𝑁) ∨ ((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = 𝑁 ∧ 𝑁 = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}))))
17		simpl 109	. . . . . . . . . 10 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → 𝐺 ∈ USGraph)
18		simpl 109	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) → 𝑦 ∈ 𝐴)
19	17, 18	anim12i 338	. . . . . . . . 9 ⊢ (((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝐺 ∈ USGraph ∧ 𝑦 ∈ 𝐴))
20	1, 2, 3	usgredg2vlem2 16476	. . . . . . . . 9 ⊢ ((𝐺 ∈ USGraph ∧ 𝑦 ∈ 𝐴) → ((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) → (𝐸‘𝑦) = {(℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}), 𝑁}))
21	19, 10, 20	mpisyl 1496	. . . . . . . 8 ⊢ (((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝐸‘𝑦) = {(℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}), 𝑁})
22		an3 595	. . . . . . . . 9 ⊢ (((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝐺 ∈ USGraph ∧ 𝑤 ∈ 𝐴))
23	1, 2, 3	usgredg2vlem2 16476	. . . . . . . . 9 ⊢ ((𝐺 ∈ USGraph ∧ 𝑤 ∈ 𝐴) → ((℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁}) → (𝐸‘𝑤) = {(℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}), 𝑁}))
24	22, 12, 23	mpisyl 1496	. . . . . . . 8 ⊢ (((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝐸‘𝑤) = {(℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}), 𝑁})
25	21, 24	eqeq12d 2253	. . . . . . 7 ⊢ (((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝐸‘𝑦) = (𝐸‘𝑤) ↔ {(℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}), 𝑁} = {(℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}), 𝑁}))
26	2	usgrf1 16428	. . . . . . . . 9 ⊢ (𝐺 ∈ USGraph → 𝐸:dom 𝐸–1-1→ran 𝐸)
27	26	adantr 276	. . . . . . . 8 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → 𝐸:dom 𝐸–1-1→ran 𝐸)
28		elrabi 2979	. . . . . . . . . 10 ⊢ (𝑦 ∈ {𝑥 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑥)} → 𝑦 ∈ dom 𝐸)
29	28, 3	eleq2s 2333	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ dom 𝐸)
30		elrabi 2979	. . . . . . . . . 10 ⊢ (𝑤 ∈ {𝑥 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑥)} → 𝑤 ∈ dom 𝐸)
31	30, 3	eleq2s 2333	. . . . . . . . 9 ⊢ (𝑤 ∈ 𝐴 → 𝑤 ∈ dom 𝐸)
32	29, 31	anim12i 338	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) → (𝑦 ∈ dom 𝐸 ∧ 𝑤 ∈ dom 𝐸))
33		f1fveq 5978	. . . . . . . 8 ⊢ ((𝐸:dom 𝐸–1-1→ran 𝐸 ∧ (𝑦 ∈ dom 𝐸 ∧ 𝑤 ∈ dom 𝐸)) → ((𝐸‘𝑦) = (𝐸‘𝑤) ↔ 𝑦 = 𝑤))
34	27, 32, 33	syl2an 289	. . . . . . 7 ⊢ (((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝐸‘𝑦) = (𝐸‘𝑤) ↔ 𝑦 = 𝑤))
35		vtxex 16271	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USGraph → (Vtx‘𝐺) ∈ V)
36	1, 35	eqeltrid 2325	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USGraph → 𝑉 ∈ V)
37		riotaexg 6042	. . . . . . . . . . 11 ⊢ (𝑉 ∈ V → (℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) ∈ V)
38	36, 37	syl 14	. . . . . . . . . 10 ⊢ (𝐺 ∈ USGraph → (℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) ∈ V)
39	38	adantr 276	. . . . . . . . 9 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → (℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) ∈ V)
40		simpr 110	. . . . . . . . 9 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → 𝑁 ∈ 𝑉)
41		riotaexg 6042	. . . . . . . . . . 11 ⊢ (𝑉 ∈ V → (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) ∈ V)
42	36, 41	syl 14	. . . . . . . . . 10 ⊢ (𝐺 ∈ USGraph → (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) ∈ V)
43	42	adantr 276	. . . . . . . . 9 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) ∈ V)
44		preq12bg 3898	. . . . . . . . 9 ⊢ ((((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) ∈ V ∧ 𝑁 ∈ 𝑉) ∧ ((℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) ∈ V ∧ 𝑁 ∈ 𝑉)) → ({(℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}), 𝑁} = {(℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}), 𝑁} ↔ (((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) ∧ 𝑁 = 𝑁) ∨ ((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = 𝑁 ∧ 𝑁 = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁})))))
45	39, 40, 43, 40, 44	syl22anc 1279	. . . . . . . 8 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → ({(℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}), 𝑁} = {(℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}), 𝑁} ↔ (((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) ∧ 𝑁 = 𝑁) ∨ ((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = 𝑁 ∧ 𝑁 = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁})))))
46	45	adantr 276	. . . . . . 7 ⊢ (((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ({(℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}), 𝑁} = {(℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}), 𝑁} ↔ (((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) ∧ 𝑁 = 𝑁) ∨ ((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = 𝑁 ∧ 𝑁 = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁})))))
47	25, 34, 46	3bitr3d 218	. . . . . 6 ⊢ (((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑦 = 𝑤 ↔ (((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) ∧ 𝑁 = 𝑁) ∨ ((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = 𝑁 ∧ 𝑁 = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁})))))
48	47	adantr 276	. . . . 5 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁})) → (𝑦 = 𝑤 ↔ (((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁}) ∧ 𝑁 = 𝑁) ∨ ((℩𝑢 ∈ 𝑉 (𝐸‘𝑦) = {𝑢, 𝑁}) = 𝑁 ∧ 𝑁 = (℩𝑢 ∈ 𝑉 (𝐸‘𝑤) = {𝑢, 𝑁})))))
49	16, 48	mpbird 167	. . . 4 ⊢ ((((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) ∧ (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁})) → 𝑦 = 𝑤)
50	49	ex 115	. . 3 ⊢ (((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁}) → 𝑦 = 𝑤))
51	50	ralrimivva 2632	. 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → ∀𝑦 ∈ 𝐴 ∀𝑤 ∈ 𝐴 ((℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁}) → 𝑦 = 𝑤))
52		usgredg2v.f	. . 3 ⊢ 𝐹 = (𝑦 ∈ 𝐴 ↦ (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}))
53		fveqeq2 5704	. . . 4 ⊢ (𝑦 = 𝑤 → ((𝐸‘𝑦) = {𝑧, 𝑁} ↔ (𝐸‘𝑤) = {𝑧, 𝑁}))
54	53	riotabidv 6040	. . 3 ⊢ (𝑦 = 𝑤 → (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁}))
55	52, 54	f1mpt 5977	. 2 ⊢ (𝐹:𝐴–1-1→𝑉 ↔ (∀𝑦 ∈ 𝐴 (℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐴 ∀𝑤 ∈ 𝐴 ((℩𝑧 ∈ 𝑉 (𝐸‘𝑦) = {𝑧, 𝑁}) = (℩𝑧 ∈ 𝑉 (𝐸‘𝑤) = {𝑧, 𝑁}) → 𝑦 = 𝑤)))
56	6, 51, 55	sylanbrc 421	1 ⊢ ((𝐺 ∈ USGraph ∧ 𝑁 ∈ 𝑉) → 𝐹:𝐴–1-1→𝑉)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720   = wceq 1402   ∈ wcel 2209  ∀wral 2528  {crab 2532  Vcvv 2821  {cpr 3710   ↦ cmpt 4192  dom cdm 4774  ran crn 4775  –1-1→wf1 5374  ‘cfv 5377  ℩crio 6037  Vtxcvtx 16265  iEdgciedg 16266  USGraphcusgr 16407

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-1o 6687  df-2o 6688  df-er 6807  df-en 7023  df-sub 8499  df-inn 9306  df-2 9364  df-3 9365  df-4 9366  df-5 9367  df-6 9368  df-7 9369  df-8 9370  df-9 9371  df-n0 9566  df-dec 9780  df-ndx 13357  df-slot 13358  df-base 13360  df-edgf 16258  df-vtx 16267  df-iedg 16268  df-edg 16311  df-umgren 16347  df-usgren 16409

This theorem is used by:  usgriedgdomord  16478