Theorem ushgredgedgloop 29521

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

Hypotheses

Ref	Expression
ushgredgedgloop.e	⊢ 𝐸 = (Edg‘𝐺)
ushgredgedgloop.i	⊢ 𝐼 = (iEdg‘𝐺)
ushgredgedgloop.a	⊢ 𝐴 = {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}
ushgredgedgloop.b	⊢ 𝐵 = {𝑒 ∈ 𝐸 ∣ 𝑒 = {𝑁}}
ushgredgedgloop.f	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐼‘𝑥))

Assertion

Ref	Expression
ushgredgedgloop	⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐹:𝐴–1-1-onto→𝐵)

Distinct variable groups:   𝐵,𝑒   𝑒,𝐸,𝑖   𝑒,𝐺,𝑖,𝑥   𝑒,𝐼,𝑖,𝑥   𝑒,𝑁,𝑖,𝑥   𝑒,𝑉,𝑖,𝑥

Allowed substitution hints:   𝐴(𝑥,𝑒,𝑖)   𝐵(𝑥,𝑖)   𝐸(𝑥)   𝐹(𝑥,𝑒,𝑖)

Proof of Theorem ushgredgedgloop

Dummy variables 𝑓 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2769	. . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
2		ushgredgedgloop.i	. . . . 5 ⊢ 𝐼 = (iEdg‘𝐺)
3	1, 2	ushgrf 29353	. . . 4 ⊢ (𝐺 ∈ USHGraph → 𝐼:dom 𝐼–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}))
4	3	adantr 485	. . 3 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐼:dom 𝐼–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}))
5		ssrab2 4042	. . 3 ⊢ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} ⊆ dom 𝐼
6		f1ores 6836	. . 3 ⊢ ((𝐼:dom 𝐼–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}) ∧ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} ⊆ dom 𝐼) → (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}):{𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}–1-1-onto→(𝐼 “ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}))
7	4, 5, 6	sylancl 597	. 2 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}):{𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}–1-1-onto→(𝐼 “ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}))
8		ushgredgedgloop.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐼‘𝑥))
9		ushgredgedgloop.a	. . . . . . 7 ⊢ 𝐴 = {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}
10	9	a1i 11	. . . . . 6 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐴 = {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}})
11		eqidd 2770	. . . . . 6 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑥 ∈ 𝐴) → (𝐼‘𝑥) = (𝐼‘𝑥))
12	10, 11	mpteq12dva 5201	. . . . 5 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝑥 ∈ 𝐴 ↦ (𝐼‘𝑥)) = (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} ↦ (𝐼‘𝑥)))
13	8, 12	eqtrid 2816	. . . 4 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐹 = (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} ↦ (𝐼‘𝑥)))
14		f1f 6775	. . . . . . 7 ⊢ (𝐼:dom 𝐼–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}) → 𝐼:dom 𝐼⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))
15	3, 14	syl 18	. . . . . 6 ⊢ (𝐺 ∈ USHGraph → 𝐼:dom 𝐼⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))
16	5	a1i 11	. . . . . 6 ⊢ (𝐺 ∈ USHGraph → {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} ⊆ dom 𝐼)
17	15, 16	feqresmpt 6951	. . . . 5 ⊢ (𝐺 ∈ USHGraph → (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}) = (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} ↦ (𝐼‘𝑥)))
18	17	adantr 485	. . . 4 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}) = (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} ↦ (𝐼‘𝑥)))
19	13, 18	eqtr4d 2807	. . 3 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐹 = (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}))
20		ushgruhgr 29359	. . . . . . . 8 ⊢ (𝐺 ∈ USHGraph → 𝐺 ∈ UHGraph)
21		eqid 2769	. . . . . . . . 9 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
22	21	uhgrfun 29356	. . . . . . . 8 ⊢ (𝐺 ∈ UHGraph → Fun (iEdg‘𝐺))
23	20, 22	syl 18	. . . . . . 7 ⊢ (𝐺 ∈ USHGraph → Fun (iEdg‘𝐺))
24	2	funeqi 6558	. . . . . . 7 ⊢ (Fun 𝐼 ↔ Fun (iEdg‘𝐺))
25	23, 24	sylibr 237	. . . . . 6 ⊢ (𝐺 ∈ USHGraph → Fun 𝐼)
26	25	adantr 485	. . . . 5 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → Fun 𝐼)
27		dfimafn 6944	. . . . 5 ⊢ ((Fun 𝐼 ∧ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} ⊆ dom 𝐼) → (𝐼 “ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}) = {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑒})
28	26, 5, 27	sylancl 597	. . . 4 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝐼 “ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}) = {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑒})
29		fveqeq2 6891	. . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → ((𝐼‘𝑖) = {𝑁} ↔ (𝐼‘𝑗) = {𝑁}))
30	29	elrab 3659	. . . . . . . . 9 ⊢ (𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} ↔ (𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}))
31		simpl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}) → 𝑗 ∈ dom 𝐼)
32		fvelrn 7072	. . . . . . . . . . . . . . . 16 ⊢ ((Fun 𝐼 ∧ 𝑗 ∈ dom 𝐼) → (𝐼‘𝑗) ∈ ran 𝐼)
33	2	eqcomi 2778	. . . . . . . . . . . . . . . . 17 ⊢ (iEdg‘𝐺) = 𝐼
34	33	rneqi 5928	. . . . . . . . . . . . . . . 16 ⊢ ran (iEdg‘𝐺) = ran 𝐼
35	32, 34	eleqtrrdi 2880	. . . . . . . . . . . . . . 15 ⊢ ((Fun 𝐼 ∧ 𝑗 ∈ dom 𝐼) → (𝐼‘𝑗) ∈ ran (iEdg‘𝐺))
36	26, 31, 35	syl2an 607	. . . . . . . . . . . . . 14 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁})) → (𝐼‘𝑗) ∈ ran (iEdg‘𝐺))
37	36	3adant3 1148	. . . . . . . . . . . . 13 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}) ∧ (𝐼‘𝑗) = 𝑓) → (𝐼‘𝑗) ∈ ran (iEdg‘𝐺))
38		eleq1 2857	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = (𝐼‘𝑗) → (𝑓 ∈ ran (iEdg‘𝐺) ↔ (𝐼‘𝑗) ∈ ran (iEdg‘𝐺)))
39	38	eqcoms 2777	. . . . . . . . . . . . . 14 ⊢ ((𝐼‘𝑗) = 𝑓 → (𝑓 ∈ ran (iEdg‘𝐺) ↔ (𝐼‘𝑗) ∈ ran (iEdg‘𝐺)))
40	39	3ad2ant3 1151	. . . . . . . . . . . . 13 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}) ∧ (𝐼‘𝑗) = 𝑓) → (𝑓 ∈ ran (iEdg‘𝐺) ↔ (𝐼‘𝑗) ∈ ran (iEdg‘𝐺)))
41	37, 40	mpbird 260	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}) ∧ (𝐼‘𝑗) = 𝑓) → 𝑓 ∈ ran (iEdg‘𝐺))
42		ushgredgedgloop.e	. . . . . . . . . . . . . . . 16 ⊢ 𝐸 = (Edg‘𝐺)
43		edgval 29339	. . . . . . . . . . . . . . . . 17 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
44	43	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ∈ USHGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
45	42, 44	eqtrid 2816	. . . . . . . . . . . . . . 15 ⊢ (𝐺 ∈ USHGraph → 𝐸 = ran (iEdg‘𝐺))
46	45	eleq2d 2855	. . . . . . . . . . . . . 14 ⊢ (𝐺 ∈ USHGraph → (𝑓 ∈ 𝐸 ↔ 𝑓 ∈ ran (iEdg‘𝐺)))
47	46	adantr 485	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝑓 ∈ 𝐸 ↔ 𝑓 ∈ ran (iEdg‘𝐺)))
48	47	3ad2ant1 1149	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}) ∧ (𝐼‘𝑗) = 𝑓) → (𝑓 ∈ 𝐸 ↔ 𝑓 ∈ ran (iEdg‘𝐺)))
49	41, 48	mpbird 260	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}) ∧ (𝐼‘𝑗) = 𝑓) → 𝑓 ∈ 𝐸)
50		eqeq1 2773	. . . . . . . . . . . . . . 15 ⊢ ((𝐼‘𝑗) = 𝑓 → ((𝐼‘𝑗) = {𝑁} ↔ 𝑓 = {𝑁}))
51	50	biimpcd 252	. . . . . . . . . . . . . 14 ⊢ ((𝐼‘𝑗) = {𝑁} → ((𝐼‘𝑗) = 𝑓 → 𝑓 = {𝑁}))
52	51	adantl 486	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}) → ((𝐼‘𝑗) = 𝑓 → 𝑓 = {𝑁}))
53	52	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → ((𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}) → ((𝐼‘𝑗) = 𝑓 → 𝑓 = {𝑁})))
54	53	3imp 1126	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}) ∧ (𝐼‘𝑗) = 𝑓) → 𝑓 = {𝑁})
55	49, 54	jca 520	. . . . . . . . . 10 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}) ∧ (𝐼‘𝑗) = 𝑓) → (𝑓 ∈ 𝐸 ∧ 𝑓 = {𝑁}))
56	55	3exp 1135	. . . . . . . . 9 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → ((𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}) → ((𝐼‘𝑗) = 𝑓 → (𝑓 ∈ 𝐸 ∧ 𝑓 = {𝑁}))))
57	30, 56	biimtrid 245	. . . . . . . 8 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} → ((𝐼‘𝑗) = 𝑓 → (𝑓 ∈ 𝐸 ∧ 𝑓 = {𝑁}))))
58	57	rexlimdv 3170	. . . . . . 7 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑓 → (𝑓 ∈ 𝐸 ∧ 𝑓 = {𝑁})))
59	23	funfnd 6568	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺) Fn dom (iEdg‘𝐺))
60		fvelrnb 6942	. . . . . . . . . . . 12 ⊢ ((iEdg‘𝐺) Fn dom (iEdg‘𝐺) → (𝑓 ∈ ran (iEdg‘𝐺) ↔ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓))
61	59, 60	syl 18	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USHGraph → (𝑓 ∈ ran (iEdg‘𝐺) ↔ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓))
62	33	dmeqi 5895	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ dom (iEdg‘𝐺) = dom 𝐼
63	62	eleq2i 2861	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑗 ∈ dom (iEdg‘𝐺) ↔ 𝑗 ∈ dom 𝐼)
64	63	biimpi 219	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑗 ∈ dom (iEdg‘𝐺) → 𝑗 ∈ dom 𝐼)
65	64	adantr 485	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓) → 𝑗 ∈ dom 𝐼)
66	65	adantl 486	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → 𝑗 ∈ dom 𝐼)
67	33	fveq1i 6883	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((iEdg‘𝐺)‘𝑗) = (𝐼‘𝑗)
68	67	eqeq2i 2782	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑓 = ((iEdg‘𝐺)‘𝑗) ↔ 𝑓 = (𝐼‘𝑗))
69	68	biimpi 219	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑓 = ((iEdg‘𝐺)‘𝑗) → 𝑓 = (𝐼‘𝑗))
70	69	eqcoms 2777	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((iEdg‘𝐺)‘𝑗) = 𝑓 → 𝑓 = (𝐼‘𝑗))
71	70	eqeq1d 2771	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝑓 = {𝑁} ↔ (𝐼‘𝑗) = {𝑁}))
72	71	biimpcd 252	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑓 = {𝑁} → (((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝐼‘𝑗) = {𝑁}))
73	72	adantl 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) → (((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝐼‘𝑗) = {𝑁}))
74	73	adantld 495	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) → ((𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓) → (𝐼‘𝑗) = {𝑁}))
75	74	imp 411	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → (𝐼‘𝑗) = {𝑁})
76	66, 75	jca 520	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → (𝑗 ∈ dom 𝐼 ∧ (𝐼‘𝑗) = {𝑁}))
77	76, 30	sylibr 237	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → 𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}})
78	67	eqeq1i 2774	. . . . . . . . . . . . . . . . . . 19 ⊢ (((iEdg‘𝐺)‘𝑗) = 𝑓 ↔ (𝐼‘𝑗) = 𝑓)
79	78	biimpi 219	. . . . . . . . . . . . . . . . . 18 ⊢ (((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝐼‘𝑗) = 𝑓)
80	79	adantl 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓) → (𝐼‘𝑗) = 𝑓)
81	80	adantl 486	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → (𝐼‘𝑗) = 𝑓)
82	77, 81	jca 520	. . . . . . . . . . . . . . 15 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → (𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} ∧ (𝐼‘𝑗) = 𝑓))
83	82	ex 417	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) → ((𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓) → (𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} ∧ (𝐼‘𝑗) = 𝑓)))
84	83	reximdv2 3181	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) → (∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓 → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑓))
85	84	ex 417	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USHGraph → (𝑓 = {𝑁} → (∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓 → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑓)))
86	85	com23 87	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USHGraph → (∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝑓 = {𝑁} → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑓)))
87	61, 86	sylbid 243	. . . . . . . . . 10 ⊢ (𝐺 ∈ USHGraph → (𝑓 ∈ ran (iEdg‘𝐺) → (𝑓 = {𝑁} → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑓)))
88	46, 87	sylbid 243	. . . . . . . . 9 ⊢ (𝐺 ∈ USHGraph → (𝑓 ∈ 𝐸 → (𝑓 = {𝑁} → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑓)))
89	88	impd 415	. . . . . . . 8 ⊢ (𝐺 ∈ USHGraph → ((𝑓 ∈ 𝐸 ∧ 𝑓 = {𝑁}) → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑓))
90	89	adantr 485	. . . . . . 7 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → ((𝑓 ∈ 𝐸 ∧ 𝑓 = {𝑁}) → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑓))
91	58, 90	impbid 215	. . . . . 6 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑓 ↔ (𝑓 ∈ 𝐸 ∧ 𝑓 = {𝑁})))
92		vex 3467	. . . . . . 7 ⊢ 𝑓 ∈ V
93		eqeq2 2781	. . . . . . . 8 ⊢ (𝑒 = 𝑓 → ((𝐼‘𝑗) = 𝑒 ↔ (𝐼‘𝑗) = 𝑓))
94	93	rexbidv 3195	. . . . . . 7 ⊢ (𝑒 = 𝑓 → (∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑒 ↔ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑓))
95	92, 94	elab 3647	. . . . . 6 ⊢ (𝑓 ∈ {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑒} ↔ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑓)
96		eqeq1 2773	. . . . . . 7 ⊢ (𝑒 = 𝑓 → (𝑒 = {𝑁} ↔ 𝑓 = {𝑁}))
97		ushgredgedgloop.b	. . . . . . 7 ⊢ 𝐵 = {𝑒 ∈ 𝐸 ∣ 𝑒 = {𝑁}}
98	96, 97	elrab2 3663	. . . . . 6 ⊢ (𝑓 ∈ 𝐵 ↔ (𝑓 ∈ 𝐸 ∧ 𝑓 = {𝑁}))
99	91, 95, 98	3bitr4g 317	. . . . 5 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝑓 ∈ {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑒} ↔ 𝑓 ∈ 𝐵))
100	99	eqrdv 2767	. . . 4 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}} (𝐼‘𝑗) = 𝑒} = 𝐵)
101	28, 100	eqtr2d 2805	. . 3 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐵 = (𝐼 “ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}))
102	19, 10, 101	f1oeq123d 6815	. 2 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}):{𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}}–1-1-onto→(𝐼 “ {𝑖 ∈ dom 𝐼 ∣ (𝐼‘𝑖) = {𝑁}})))
103	7, 102	mpbird 260	1 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐹:𝐴–1-1-onto→𝐵)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149  {cab 2747  ∃wrex 3095  {crab 3423   ∖ cdif 3910   ⊆ wss 3913  ∅c0 4294  𝒫 cpw 4567  {csn 4594   ↦ cmpt 5196  dom cdm 5662  ran crn 5663   ↾ cres 5664   “ cima 5665  Fun wfun 6531   Fn wfn 6532  ⟶wf 6533  –1-1→wf1 6534  –1-1-onto→wf1o 6536  ‘cfv 6537  Vtxcvtx 29286  iEdgciedg 29287  Edgcedg 29337  UHGraphcuhgr 29346  USHGraphcushgr 29347

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405  ax-un 7733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-edg 29338  df-uhgr 29348  df-ushgr 29349

This theorem is referenced by:  vtxdushgrfvedg  29780