Theorem ushgredgedg 29207

Description: In a simple hypergraph there is a 1-1 onto mapping between the indexed edges containing a fixed vertex and the set of edges containing this vertex. (Contributed by AV, 11-Dec-2020.)

Hypotheses

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

Assertion

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

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

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

Proof of Theorem ushgredgedg

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

Step	Hyp	Ref	Expression
1		eqid 2731	. . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
2		ushgredgedg.i	. . . . 5 ⊢ 𝐼 = (iEdg‘𝐺)
3	1, 2	ushgrf 29041	. . . 4 ⊢ (𝐺 ∈ USHGraph → 𝐼:dom 𝐼–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}))
4	3	adantr 480	. . 3 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐼:dom 𝐼–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}))
5		ssrab2 4027	. . 3 ⊢ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} ⊆ dom 𝐼
6		f1ores 6777	. . 3 ⊢ ((𝐼:dom 𝐼–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}) ∧ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} ⊆ dom 𝐼) → (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}):{𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}–1-1-onto→(𝐼 “ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}))
7	4, 5, 6	sylancl 586	. 2 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}):{𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}–1-1-onto→(𝐼 “ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}))
8		ushgredgedg.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐼‘𝑥))
9		ushgredgedg.a	. . . . . . 7 ⊢ 𝐴 = {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}
10	9	a1i 11	. . . . . 6 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐴 = {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)})
11		eqidd 2732	. . . . . 6 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑥 ∈ 𝐴) → (𝐼‘𝑥) = (𝐼‘𝑥))
12	10, 11	mpteq12dva 5175	. . . . 5 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝑥 ∈ 𝐴 ↦ (𝐼‘𝑥)) = (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} ↦ (𝐼‘𝑥)))
13	8, 12	eqtrid 2778	. . . 4 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐹 = (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} ↦ (𝐼‘𝑥)))
14		f1f 6719	. . . . . . . 8 ⊢ (𝐼:dom 𝐼–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}) → 𝐼:dom 𝐼⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))
15	3, 14	syl 17	. . . . . . 7 ⊢ (𝐺 ∈ USHGraph → 𝐼:dom 𝐼⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))
16	5	a1i 11	. . . . . . 7 ⊢ (𝐺 ∈ USHGraph → {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} ⊆ dom 𝐼)
17	15, 16	feqresmpt 6891	. . . . . 6 ⊢ (𝐺 ∈ USHGraph → (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}) = (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} ↦ (𝐼‘𝑥)))
18	17	adantr 480	. . . . 5 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}) = (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} ↦ (𝐼‘𝑥)))
19	18	eqcomd 2737	. . . 4 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} ↦ (𝐼‘𝑥)) = (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}))
20	13, 19	eqtrd 2766	. . 3 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐹 = (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}))
21		ushgruhgr 29047	. . . . . . . . 9 ⊢ (𝐺 ∈ USHGraph → 𝐺 ∈ UHGraph)
22		eqid 2731	. . . . . . . . . 10 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺)
23	22	uhgrfun 29044	. . . . . . . . 9 ⊢ (𝐺 ∈ UHGraph → Fun (iEdg‘𝐺))
24	21, 23	syl 17	. . . . . . . 8 ⊢ (𝐺 ∈ USHGraph → Fun (iEdg‘𝐺))
25	2	funeqi 6502	. . . . . . . 8 ⊢ (Fun 𝐼 ↔ Fun (iEdg‘𝐺))
26	24, 25	sylibr 234	. . . . . . 7 ⊢ (𝐺 ∈ USHGraph → Fun 𝐼)
27	26	adantr 480	. . . . . 6 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → Fun 𝐼)
28		dfimafn 6884	. . . . . 6 ⊢ ((Fun 𝐼 ∧ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} ⊆ dom 𝐼) → (𝐼 “ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}) = {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑒})
29	27, 5, 28	sylancl 586	. . . . 5 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝐼 “ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}) = {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑒})
30		fveq2 6822	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑗 → (𝐼‘𝑖) = (𝐼‘𝑗))
31	30	eleq2d 2817	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑗 → (𝑁 ∈ (𝐼‘𝑖) ↔ 𝑁 ∈ (𝐼‘𝑗)))
32	31	elrab 3642	. . . . . . . . . 10 ⊢ (𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} ↔ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)))
33		simpl 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)) → 𝑗 ∈ dom 𝐼)
34		fvelrn 7009	. . . . . . . . . . . . . . . . 17 ⊢ ((Fun 𝐼 ∧ 𝑗 ∈ dom 𝐼) → (𝐼‘𝑗) ∈ ran 𝐼)
35	2	eqcomi 2740	. . . . . . . . . . . . . . . . . . 19 ⊢ (iEdg‘𝐺) = 𝐼
36	35	rneqi 5876	. . . . . . . . . . . . . . . . . 18 ⊢ ran (iEdg‘𝐺) = ran 𝐼
37	36	eleq2i 2823	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐼‘𝑗) ∈ ran (iEdg‘𝐺) ↔ (𝐼‘𝑗) ∈ ran 𝐼)
38	34, 37	sylibr 234	. . . . . . . . . . . . . . . 16 ⊢ ((Fun 𝐼 ∧ 𝑗 ∈ dom 𝐼) → (𝐼‘𝑗) ∈ ran (iEdg‘𝐺))
39	27, 33, 38	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗))) → (𝐼‘𝑗) ∈ ran (iEdg‘𝐺))
40	39	3adant3 1132	. . . . . . . . . . . . . 14 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)) ∧ (𝐼‘𝑗) = 𝑓) → (𝐼‘𝑗) ∈ ran (iEdg‘𝐺))
41		eleq1 2819	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = (𝐼‘𝑗) → (𝑓 ∈ ran (iEdg‘𝐺) ↔ (𝐼‘𝑗) ∈ ran (iEdg‘𝐺)))
42	41	eqcoms 2739	. . . . . . . . . . . . . . 15 ⊢ ((𝐼‘𝑗) = 𝑓 → (𝑓 ∈ ran (iEdg‘𝐺) ↔ (𝐼‘𝑗) ∈ ran (iEdg‘𝐺)))
43	42	3ad2ant3 1135	. . . . . . . . . . . . . 14 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)) ∧ (𝐼‘𝑗) = 𝑓) → (𝑓 ∈ ran (iEdg‘𝐺) ↔ (𝐼‘𝑗) ∈ ran (iEdg‘𝐺)))
44	40, 43	mpbird 257	. . . . . . . . . . . . 13 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)) ∧ (𝐼‘𝑗) = 𝑓) → 𝑓 ∈ ran (iEdg‘𝐺))
45		ushgredgedg.e	. . . . . . . . . . . . . . . . 17 ⊢ 𝐸 = (Edg‘𝐺)
46		edgval 29027	. . . . . . . . . . . . . . . . . 18 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
47	46	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ (𝐺 ∈ USHGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
48	45, 47	eqtrid 2778	. . . . . . . . . . . . . . . 16 ⊢ (𝐺 ∈ USHGraph → 𝐸 = ran (iEdg‘𝐺))
49	48	eleq2d 2817	. . . . . . . . . . . . . . 15 ⊢ (𝐺 ∈ USHGraph → (𝑓 ∈ 𝐸 ↔ 𝑓 ∈ ran (iEdg‘𝐺)))
50	49	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝑓 ∈ 𝐸 ↔ 𝑓 ∈ ran (iEdg‘𝐺)))
51	50	3ad2ant1 1133	. . . . . . . . . . . . 13 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)) ∧ (𝐼‘𝑗) = 𝑓) → (𝑓 ∈ 𝐸 ↔ 𝑓 ∈ ran (iEdg‘𝐺)))
52	44, 51	mpbird 257	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)) ∧ (𝐼‘𝑗) = 𝑓) → 𝑓 ∈ 𝐸)
53		eleq2 2820	. . . . . . . . . . . . . . . 16 ⊢ ((𝐼‘𝑗) = 𝑓 → (𝑁 ∈ (𝐼‘𝑗) ↔ 𝑁 ∈ 𝑓))
54	53	biimpcd 249	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ (𝐼‘𝑗) → ((𝐼‘𝑗) = 𝑓 → 𝑁 ∈ 𝑓))
55	54	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)) → ((𝐼‘𝑗) = 𝑓 → 𝑁 ∈ 𝑓))
56	55	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → ((𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)) → ((𝐼‘𝑗) = 𝑓 → 𝑁 ∈ 𝑓)))
57	56	3imp 1110	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)) ∧ (𝐼‘𝑗) = 𝑓) → 𝑁 ∈ 𝑓)
58	52, 57	jca 511	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)) ∧ (𝐼‘𝑗) = 𝑓) → (𝑓 ∈ 𝐸 ∧ 𝑁 ∈ 𝑓))
59	58	3exp 1119	. . . . . . . . . 10 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → ((𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)) → ((𝐼‘𝑗) = 𝑓 → (𝑓 ∈ 𝐸 ∧ 𝑁 ∈ 𝑓))))
60	32, 59	biimtrid 242	. . . . . . . . 9 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} → ((𝐼‘𝑗) = 𝑓 → (𝑓 ∈ 𝐸 ∧ 𝑁 ∈ 𝑓))))
61	60	rexlimdv 3131	. . . . . . . 8 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑓 → (𝑓 ∈ 𝐸 ∧ 𝑁 ∈ 𝑓)))
62	24	funfnd 6512	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ USHGraph → (iEdg‘𝐺) Fn dom (iEdg‘𝐺))
63		fvelrnb 6882	. . . . . . . . . . . . 13 ⊢ ((iEdg‘𝐺) Fn dom (iEdg‘𝐺) → (𝑓 ∈ ran (iEdg‘𝐺) ↔ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓))
64	62, 63	syl 17	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USHGraph → (𝑓 ∈ ran (iEdg‘𝐺) ↔ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓))
65	35	dmeqi 5843	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ dom (iEdg‘𝐺) = dom 𝐼
66	65	eleq2i 2823	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑗 ∈ dom (iEdg‘𝐺) ↔ 𝑗 ∈ dom 𝐼)
67	66	biimpi 216	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑗 ∈ dom (iEdg‘𝐺) → 𝑗 ∈ dom 𝐼)
68	67	adantr 480	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓) → 𝑗 ∈ dom 𝐼)
69	68	adantl 481	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑓) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → 𝑗 ∈ dom 𝐼)
70	35	fveq1i 6823	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((iEdg‘𝐺)‘𝑗) = (𝐼‘𝑗)
71	70	eqeq2i 2744	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑓 = ((iEdg‘𝐺)‘𝑗) ↔ 𝑓 = (𝐼‘𝑗))
72	71	biimpi 216	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑓 = ((iEdg‘𝐺)‘𝑗) → 𝑓 = (𝐼‘𝑗))
73	72	eqcoms 2739	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((iEdg‘𝐺)‘𝑗) = 𝑓 → 𝑓 = (𝐼‘𝑗))
74	73	eleq2d 2817	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝑁 ∈ 𝑓 ↔ 𝑁 ∈ (𝐼‘𝑗)))
75	74	biimpcd 249	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 ∈ 𝑓 → (((iEdg‘𝐺)‘𝑗) = 𝑓 → 𝑁 ∈ (𝐼‘𝑗)))
76	75	adantl 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑓) → (((iEdg‘𝐺)‘𝑗) = 𝑓 → 𝑁 ∈ (𝐼‘𝑗)))
77	76	adantld 490	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑓) → ((𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓) → 𝑁 ∈ (𝐼‘𝑗)))
78	77	imp 406	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑓) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → 𝑁 ∈ (𝐼‘𝑗))
79	69, 78	jca 511	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑓) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → (𝑗 ∈ dom 𝐼 ∧ 𝑁 ∈ (𝐼‘𝑗)))
80	79, 32	sylibr 234	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑓) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → 𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)})
81	70	eqeq1i 2736	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((iEdg‘𝐺)‘𝑗) = 𝑓 ↔ (𝐼‘𝑗) = 𝑓)
82	81	biimpi 216	. . . . . . . . . . . . . . . . . . 19 ⊢ (((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝐼‘𝑗) = 𝑓)
83	82	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓) → (𝐼‘𝑗) = 𝑓)
84	83	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑓) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → (𝐼‘𝑗) = 𝑓)
85	80, 84	jca 511	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑓) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → (𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} ∧ (𝐼‘𝑗) = 𝑓))
86	85	ex 412	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑓) → ((𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓) → (𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} ∧ (𝐼‘𝑗) = 𝑓)))
87	86	reximdv2 3142	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑓) → (∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓 → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑓))
88	87	ex 412	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ USHGraph → (𝑁 ∈ 𝑓 → (∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓 → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑓)))
89	88	com23 86	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ USHGraph → (∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝑁 ∈ 𝑓 → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑓)))
90	64, 89	sylbid 240	. . . . . . . . . . 11 ⊢ (𝐺 ∈ USHGraph → (𝑓 ∈ ran (iEdg‘𝐺) → (𝑁 ∈ 𝑓 → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑓)))
91	49, 90	sylbid 240	. . . . . . . . . 10 ⊢ (𝐺 ∈ USHGraph → (𝑓 ∈ 𝐸 → (𝑁 ∈ 𝑓 → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑓)))
92	91	impd 410	. . . . . . . . 9 ⊢ (𝐺 ∈ USHGraph → ((𝑓 ∈ 𝐸 ∧ 𝑁 ∈ 𝑓) → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑓))
93	92	adantr 480	. . . . . . . 8 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → ((𝑓 ∈ 𝐸 ∧ 𝑁 ∈ 𝑓) → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑓))
94	61, 93	impbid 212	. . . . . . 7 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑓 ↔ (𝑓 ∈ 𝐸 ∧ 𝑁 ∈ 𝑓)))
95		vex 3440	. . . . . . . 8 ⊢ 𝑓 ∈ V
96		eqeq2 2743	. . . . . . . . 9 ⊢ (𝑒 = 𝑓 → ((𝐼‘𝑗) = 𝑒 ↔ (𝐼‘𝑗) = 𝑓))
97	96	rexbidv 3156	. . . . . . . 8 ⊢ (𝑒 = 𝑓 → (∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑒 ↔ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑓))
98	95, 97	elab 3630	. . . . . . 7 ⊢ (𝑓 ∈ {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑒} ↔ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑓)
99		eleq2 2820	. . . . . . . 8 ⊢ (𝑒 = 𝑓 → (𝑁 ∈ 𝑒 ↔ 𝑁 ∈ 𝑓))
100		ushgredgedg.b	. . . . . . . 8 ⊢ 𝐵 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒}
101	99, 100	elrab2 3645	. . . . . . 7 ⊢ (𝑓 ∈ 𝐵 ↔ (𝑓 ∈ 𝐸 ∧ 𝑁 ∈ 𝑓))
102	94, 98, 101	3bitr4g 314	. . . . . 6 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝑓 ∈ {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑒} ↔ 𝑓 ∈ 𝐵))
103	102	eqrdv 2729	. . . . 5 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)} (𝐼‘𝑗) = 𝑒} = 𝐵)
104	29, 103	eqtrd 2766	. . . 4 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝐼 “ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}) = 𝐵)
105	104	eqcomd 2737	. . 3 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐵 = (𝐼 “ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}))
106	20, 10, 105	f1oeq123d 6757	. 2 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}):{𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)}–1-1-onto→(𝐼 “ {𝑖 ∈ dom 𝐼 ∣ 𝑁 ∈ (𝐼‘𝑖)})))
107	7, 106	mpbird 257	1 ⊢ ((𝐺 ∈ USHGraph ∧ 𝑁 ∈ 𝑉) → 𝐹:𝐴–1-1-onto→𝐵)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2111  {cab 2709  ∃wrex 3056  {crab 3395   ∖ cdif 3894   ⊆ wss 3897  ∅c0 4280  𝒫 cpw 4547  {csn 4573   ↦ cmpt 5170  dom cdm 5614  ran crn 5615   ↾ cres 5616   “ cima 5617  Fun wfun 6475   Fn wfn 6476  ⟶wf 6477  –1-1→wf1 6478  –1-1-onto→wf1o 6480  ‘cfv 6481  Vtxcvtx 28974  iEdgciedg 28975  Edgcedg 29025  UHGraphcuhgr 29034  USHGraphcushgr 29035

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368  ax-un 7668

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-sbc 3737  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-edg 29026  df-uhgr 29036  df-ushgr 29037

This theorem is referenced by:  usgredgedg  29208  vtxdushgrfvedglem  29468