MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ushgredgedgloop Structured version   Visualization version   GIF version

Theorem ushgredgedgloop 28756
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.
StepHypRef Expression
1 eqid 2731 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
2 ushgredgedgloop.i . . . . 5 𝐼 = (iEdg‘𝐺)
31, 2ushgrf 28591 . . . 4 (𝐺 ∈ USHGraph → 𝐼:dom 𝐼1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}))
43adantr 480 . . 3 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → 𝐼:dom 𝐼1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}))
5 ssrab2 4077 . . 3 {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} ⊆ dom 𝐼
6 f1ores 6847 . . 3 ((𝐼:dom 𝐼1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}) ∧ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} ⊆ dom 𝐼) → (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}):{𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}–1-1-onto→(𝐼 “ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}))
74, 5, 6sylancl 585 . 2 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}):{𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}–1-1-onto→(𝐼 “ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}))
8 ushgredgedgloop.f . . . . 5 𝐹 = (𝑥𝐴 ↦ (𝐼𝑥))
9 ushgredgedgloop.a . . . . . . 7 𝐴 = {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}
109a1i 11 . . . . . 6 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → 𝐴 = {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}})
11 eqidd 2732 . . . . . 6 (((𝐺 ∈ USHGraph ∧ 𝑁𝑉) ∧ 𝑥𝐴) → (𝐼𝑥) = (𝐼𝑥))
1210, 11mpteq12dva 5237 . . . . 5 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → (𝑥𝐴 ↦ (𝐼𝑥)) = (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} ↦ (𝐼𝑥)))
138, 12eqtrid 2783 . . . 4 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → 𝐹 = (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} ↦ (𝐼𝑥)))
14 f1f 6787 . . . . . . 7 (𝐼:dom 𝐼1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}) → 𝐼:dom 𝐼⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))
153, 14syl 17 . . . . . 6 (𝐺 ∈ USHGraph → 𝐼:dom 𝐼⟶(𝒫 (Vtx‘𝐺) ∖ {∅}))
165a1i 11 . . . . . 6 (𝐺 ∈ USHGraph → {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} ⊆ dom 𝐼)
1715, 16feqresmpt 6961 . . . . 5 (𝐺 ∈ USHGraph → (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}) = (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} ↦ (𝐼𝑥)))
1817adantr 480 . . . 4 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}) = (𝑥 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} ↦ (𝐼𝑥)))
1913, 18eqtr4d 2774 . . 3 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → 𝐹 = (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}))
20 ushgruhgr 28597 . . . . . . . 8 (𝐺 ∈ USHGraph → 𝐺 ∈ UHGraph)
21 eqid 2731 . . . . . . . . 9 (iEdg‘𝐺) = (iEdg‘𝐺)
2221uhgrfun 28594 . . . . . . . 8 (𝐺 ∈ UHGraph → Fun (iEdg‘𝐺))
2320, 22syl 17 . . . . . . 7 (𝐺 ∈ USHGraph → Fun (iEdg‘𝐺))
242funeqi 6569 . . . . . . 7 (Fun 𝐼 ↔ Fun (iEdg‘𝐺))
2523, 24sylibr 233 . . . . . 6 (𝐺 ∈ USHGraph → Fun 𝐼)
2625adantr 480 . . . . 5 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → Fun 𝐼)
27 dfimafn 6954 . . . . 5 ((Fun 𝐼 ∧ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} ⊆ dom 𝐼) → (𝐼 “ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}) = {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑒})
2826, 5, 27sylancl 585 . . . 4 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → (𝐼 “ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}) = {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑒})
29 fveqeq2 6900 . . . . . . . . . 10 (𝑖 = 𝑗 → ((𝐼𝑖) = {𝑁} ↔ (𝐼𝑗) = {𝑁}))
3029elrab 3683 . . . . . . . . 9 (𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} ↔ (𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}))
31 simpl 482 . . . . . . . . . . . . . . 15 ((𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}) → 𝑗 ∈ dom 𝐼)
32 fvelrn 7078 . . . . . . . . . . . . . . . 16 ((Fun 𝐼𝑗 ∈ dom 𝐼) → (𝐼𝑗) ∈ ran 𝐼)
332eqcomi 2740 . . . . . . . . . . . . . . . . 17 (iEdg‘𝐺) = 𝐼
3433rneqi 5936 . . . . . . . . . . . . . . . 16 ran (iEdg‘𝐺) = ran 𝐼
3532, 34eleqtrrdi 2843 . . . . . . . . . . . . . . 15 ((Fun 𝐼𝑗 ∈ dom 𝐼) → (𝐼𝑗) ∈ ran (iEdg‘𝐺))
3626, 31, 35syl2an 595 . . . . . . . . . . . . . 14 (((𝐺 ∈ USHGraph ∧ 𝑁𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁})) → (𝐼𝑗) ∈ ran (iEdg‘𝐺))
37363adant3 1131 . . . . . . . . . . . . 13 (((𝐺 ∈ USHGraph ∧ 𝑁𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}) ∧ (𝐼𝑗) = 𝑓) → (𝐼𝑗) ∈ ran (iEdg‘𝐺))
38 eleq1 2820 . . . . . . . . . . . . . . 15 (𝑓 = (𝐼𝑗) → (𝑓 ∈ ran (iEdg‘𝐺) ↔ (𝐼𝑗) ∈ ran (iEdg‘𝐺)))
3938eqcoms 2739 . . . . . . . . . . . . . 14 ((𝐼𝑗) = 𝑓 → (𝑓 ∈ ran (iEdg‘𝐺) ↔ (𝐼𝑗) ∈ ran (iEdg‘𝐺)))
40393ad2ant3 1134 . . . . . . . . . . . . 13 (((𝐺 ∈ USHGraph ∧ 𝑁𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}) ∧ (𝐼𝑗) = 𝑓) → (𝑓 ∈ ran (iEdg‘𝐺) ↔ (𝐼𝑗) ∈ ran (iEdg‘𝐺)))
4137, 40mpbird 257 . . . . . . . . . . . 12 (((𝐺 ∈ USHGraph ∧ 𝑁𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}) ∧ (𝐼𝑗) = 𝑓) → 𝑓 ∈ ran (iEdg‘𝐺))
42 ushgredgedgloop.e . . . . . . . . . . . . . . . 16 𝐸 = (Edg‘𝐺)
43 edgval 28577 . . . . . . . . . . . . . . . . 17 (Edg‘𝐺) = ran (iEdg‘𝐺)
4443a1i 11 . . . . . . . . . . . . . . . 16 (𝐺 ∈ USHGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
4542, 44eqtrid 2783 . . . . . . . . . . . . . . 15 (𝐺 ∈ USHGraph → 𝐸 = ran (iEdg‘𝐺))
4645eleq2d 2818 . . . . . . . . . . . . . 14 (𝐺 ∈ USHGraph → (𝑓𝐸𝑓 ∈ ran (iEdg‘𝐺)))
4746adantr 480 . . . . . . . . . . . . 13 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → (𝑓𝐸𝑓 ∈ ran (iEdg‘𝐺)))
48473ad2ant1 1132 . . . . . . . . . . . 12 (((𝐺 ∈ USHGraph ∧ 𝑁𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}) ∧ (𝐼𝑗) = 𝑓) → (𝑓𝐸𝑓 ∈ ran (iEdg‘𝐺)))
4941, 48mpbird 257 . . . . . . . . . . 11 (((𝐺 ∈ USHGraph ∧ 𝑁𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}) ∧ (𝐼𝑗) = 𝑓) → 𝑓𝐸)
50 eqeq1 2735 . . . . . . . . . . . . . . 15 ((𝐼𝑗) = 𝑓 → ((𝐼𝑗) = {𝑁} ↔ 𝑓 = {𝑁}))
5150biimpcd 248 . . . . . . . . . . . . . 14 ((𝐼𝑗) = {𝑁} → ((𝐼𝑗) = 𝑓𝑓 = {𝑁}))
5251adantl 481 . . . . . . . . . . . . 13 ((𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}) → ((𝐼𝑗) = 𝑓𝑓 = {𝑁}))
5352a1i 11 . . . . . . . . . . . 12 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → ((𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}) → ((𝐼𝑗) = 𝑓𝑓 = {𝑁})))
54533imp 1110 . . . . . . . . . . 11 (((𝐺 ∈ USHGraph ∧ 𝑁𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}) ∧ (𝐼𝑗) = 𝑓) → 𝑓 = {𝑁})
5549, 54jca 511 . . . . . . . . . 10 (((𝐺 ∈ USHGraph ∧ 𝑁𝑉) ∧ (𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}) ∧ (𝐼𝑗) = 𝑓) → (𝑓𝐸𝑓 = {𝑁}))
56553exp 1118 . . . . . . . . 9 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → ((𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}) → ((𝐼𝑗) = 𝑓 → (𝑓𝐸𝑓 = {𝑁}))))
5730, 56biimtrid 241 . . . . . . . 8 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → (𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} → ((𝐼𝑗) = 𝑓 → (𝑓𝐸𝑓 = {𝑁}))))
5857rexlimdv 3152 . . . . . . 7 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → (∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑓 → (𝑓𝐸𝑓 = {𝑁})))
5923funfnd 6579 . . . . . . . . . . . 12 (𝐺 ∈ USHGraph → (iEdg‘𝐺) Fn dom (iEdg‘𝐺))
60 fvelrnb 6952 . . . . . . . . . . . 12 ((iEdg‘𝐺) Fn dom (iEdg‘𝐺) → (𝑓 ∈ ran (iEdg‘𝐺) ↔ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓))
6159, 60syl 17 . . . . . . . . . . 11 (𝐺 ∈ USHGraph → (𝑓 ∈ ran (iEdg‘𝐺) ↔ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓))
6233dmeqi 5904 . . . . . . . . . . . . . . . . . . . . . 22 dom (iEdg‘𝐺) = dom 𝐼
6362eleq2i 2824 . . . . . . . . . . . . . . . . . . . . 21 (𝑗 ∈ dom (iEdg‘𝐺) ↔ 𝑗 ∈ dom 𝐼)
6463biimpi 215 . . . . . . . . . . . . . . . . . . . 20 (𝑗 ∈ dom (iEdg‘𝐺) → 𝑗 ∈ dom 𝐼)
6564adantr 480 . . . . . . . . . . . . . . . . . . 19 ((𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓) → 𝑗 ∈ dom 𝐼)
6665adantl 481 . . . . . . . . . . . . . . . . . 18 (((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → 𝑗 ∈ dom 𝐼)
6733fveq1i 6892 . . . . . . . . . . . . . . . . . . . . . . . . . 26 ((iEdg‘𝐺)‘𝑗) = (𝐼𝑗)
6867eqeq2i 2744 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑓 = ((iEdg‘𝐺)‘𝑗) ↔ 𝑓 = (𝐼𝑗))
6968biimpi 215 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑓 = ((iEdg‘𝐺)‘𝑗) → 𝑓 = (𝐼𝑗))
7069eqcoms 2739 . . . . . . . . . . . . . . . . . . . . . . 23 (((iEdg‘𝐺)‘𝑗) = 𝑓𝑓 = (𝐼𝑗))
7170eqeq1d 2733 . . . . . . . . . . . . . . . . . . . . . 22 (((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝑓 = {𝑁} ↔ (𝐼𝑗) = {𝑁}))
7271biimpcd 248 . . . . . . . . . . . . . . . . . . . . 21 (𝑓 = {𝑁} → (((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝐼𝑗) = {𝑁}))
7372adantl 481 . . . . . . . . . . . . . . . . . . . 20 ((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) → (((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝐼𝑗) = {𝑁}))
7473adantld 490 . . . . . . . . . . . . . . . . . . 19 ((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) → ((𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓) → (𝐼𝑗) = {𝑁}))
7574imp 406 . . . . . . . . . . . . . . . . . 18 (((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → (𝐼𝑗) = {𝑁})
7666, 75jca 511 . . . . . . . . . . . . . . . . 17 (((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → (𝑗 ∈ dom 𝐼 ∧ (𝐼𝑗) = {𝑁}))
7776, 30sylibr 233 . . . . . . . . . . . . . . . 16 (((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → 𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}})
7867eqeq1i 2736 . . . . . . . . . . . . . . . . . . 19 (((iEdg‘𝐺)‘𝑗) = 𝑓 ↔ (𝐼𝑗) = 𝑓)
7978biimpi 215 . . . . . . . . . . . . . . . . . 18 (((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝐼𝑗) = 𝑓)
8079adantl 481 . . . . . . . . . . . . . . . . 17 ((𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓) → (𝐼𝑗) = 𝑓)
8180adantl 481 . . . . . . . . . . . . . . . 16 (((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → (𝐼𝑗) = 𝑓)
8277, 81jca 511 . . . . . . . . . . . . . . 15 (((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) ∧ (𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓)) → (𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} ∧ (𝐼𝑗) = 𝑓))
8382ex 412 . . . . . . . . . . . . . 14 ((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) → ((𝑗 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑗) = 𝑓) → (𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} ∧ (𝐼𝑗) = 𝑓)))
8483reximdv2 3163 . . . . . . . . . . . . 13 ((𝐺 ∈ USHGraph ∧ 𝑓 = {𝑁}) → (∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓 → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑓))
8584ex 412 . . . . . . . . . . . 12 (𝐺 ∈ USHGraph → (𝑓 = {𝑁} → (∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓 → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑓)))
8685com23 86 . . . . . . . . . . 11 (𝐺 ∈ USHGraph → (∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = 𝑓 → (𝑓 = {𝑁} → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑓)))
8761, 86sylbid 239 . . . . . . . . . 10 (𝐺 ∈ USHGraph → (𝑓 ∈ ran (iEdg‘𝐺) → (𝑓 = {𝑁} → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑓)))
8846, 87sylbid 239 . . . . . . . . 9 (𝐺 ∈ USHGraph → (𝑓𝐸 → (𝑓 = {𝑁} → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑓)))
8988impd 410 . . . . . . . 8 (𝐺 ∈ USHGraph → ((𝑓𝐸𝑓 = {𝑁}) → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑓))
9089adantr 480 . . . . . . 7 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → ((𝑓𝐸𝑓 = {𝑁}) → ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑓))
9158, 90impbid 211 . . . . . 6 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → (∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑓 ↔ (𝑓𝐸𝑓 = {𝑁})))
92 vex 3477 . . . . . . 7 𝑓 ∈ V
93 eqeq2 2743 . . . . . . . 8 (𝑒 = 𝑓 → ((𝐼𝑗) = 𝑒 ↔ (𝐼𝑗) = 𝑓))
9493rexbidv 3177 . . . . . . 7 (𝑒 = 𝑓 → (∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑒 ↔ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑓))
9592, 94elab 3668 . . . . . 6 (𝑓 ∈ {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑒} ↔ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑓)
96 eqeq1 2735 . . . . . . 7 (𝑒 = 𝑓 → (𝑒 = {𝑁} ↔ 𝑓 = {𝑁}))
97 ushgredgedgloop.b . . . . . . 7 𝐵 = {𝑒𝐸𝑒 = {𝑁}}
9896, 97elrab2 3686 . . . . . 6 (𝑓𝐵 ↔ (𝑓𝐸𝑓 = {𝑁}))
9991, 95, 983bitr4g 314 . . . . 5 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → (𝑓 ∈ {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑒} ↔ 𝑓𝐵))
10099eqrdv 2729 . . . 4 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → {𝑒 ∣ ∃𝑗 ∈ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}} (𝐼𝑗) = 𝑒} = 𝐵)
10128, 100eqtr2d 2772 . . 3 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → 𝐵 = (𝐼 “ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}))
10219, 10, 101f1oeq123d 6827 . 2 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → (𝐹:𝐴1-1-onto𝐵 ↔ (𝐼 ↾ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}):{𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}}–1-1-onto→(𝐼 “ {𝑖 ∈ dom 𝐼 ∣ (𝐼𝑖) = {𝑁}})))
1037, 102mpbird 257 1 ((𝐺 ∈ USHGraph ∧ 𝑁𝑉) → 𝐹:𝐴1-1-onto𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  w3a 1086   = wceq 1540  wcel 2105  {cab 2708  wrex 3069  {crab 3431  cdif 3945  wss 3948  c0 4322  𝒫 cpw 4602  {csn 4628  cmpt 5231  dom cdm 5676  ran crn 5677  cres 5678  cima 5679  Fun wfun 6537   Fn wfn 6538  wf 6539  1-1wf1 6540  1-1-ontowf1o 6542  cfv 6543  Vtxcvtx 28524  iEdgciedg 28525  Edgcedg 28575  UHGraphcuhgr 28584  USHGraphcushgr 28585
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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7729
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-sbc 3778  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-edg 28576  df-uhgr 28586  df-ushgr 28587
This theorem is referenced by:  vtxdushgrfvedg  29015
  Copyright terms: Public domain W3C validator