Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  isomgrtrlem Structured version   Visualization version   GIF version

Theorem isomgrtrlem 44052
Description: Lemma for isomgrtr 44053. (Contributed by AV, 5-Dec-2022.)
Assertion
Ref Expression
isomgrtrlem (((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) → ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘((𝑤𝑔)‘𝑗)))
Distinct variable groups:   𝐴,𝑖,𝑗   𝐵,𝑖,𝑗,𝑘   𝐶,𝑗,𝑘   𝑗,𝑋   𝑓,𝑖,𝑗   𝑔,𝑖,𝑗,𝑘   𝑣,𝑗,𝑘   𝑤,𝑗,𝑘
Allowed substitution hints:   𝐴(𝑤,𝑣,𝑓,𝑔,𝑘)   𝐵(𝑤,𝑣,𝑓,𝑔)   𝐶(𝑤,𝑣,𝑓,𝑔,𝑖)   𝑋(𝑤,𝑣,𝑓,𝑔,𝑖,𝑘)

Proof of Theorem isomgrtrlem
StepHypRef Expression
1 imaco 6104 . . . 4 ((𝑣𝑓) “ ((iEdg‘𝐴)‘𝑗)) = (𝑣 “ (𝑓 “ ((iEdg‘𝐴)‘𝑗)))
21a1i 11 . . 3 ((((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → ((𝑣𝑓) “ ((iEdg‘𝐴)‘𝑗)) = (𝑣 “ (𝑓 “ ((iEdg‘𝐴)‘𝑗))))
3 fveq2 6670 . . . . . . . . . . 11 (𝑖 = 𝑗 → ((iEdg‘𝐴)‘𝑖) = ((iEdg‘𝐴)‘𝑗))
43imaeq2d 5929 . . . . . . . . . 10 (𝑖 = 𝑗 → (𝑓 “ ((iEdg‘𝐴)‘𝑖)) = (𝑓 “ ((iEdg‘𝐴)‘𝑗)))
5 2fveq3 6675 . . . . . . . . . 10 (𝑖 = 𝑗 → ((iEdg‘𝐵)‘(𝑔𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑗)))
64, 5eqeq12d 2837 . . . . . . . . 9 (𝑖 = 𝑗 → ((𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)) ↔ (𝑓 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐵)‘(𝑔𝑗))))
76rspccv 3620 . . . . . . . 8 (∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)) → (𝑗 ∈ dom (iEdg‘𝐴) → (𝑓 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐵)‘(𝑔𝑗))))
87adantl 484 . . . . . . 7 ((𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖))) → (𝑗 ∈ dom (iEdg‘𝐴) → (𝑓 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐵)‘(𝑔𝑗))))
98ad2antlr 725 . . . . . 6 (((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) → (𝑗 ∈ dom (iEdg‘𝐴) → (𝑓 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐵)‘(𝑔𝑗))))
109imp 409 . . . . 5 ((((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → (𝑓 “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐵)‘(𝑔𝑗)))
1110imaeq2d 5929 . . . 4 ((((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → (𝑣 “ (𝑓 “ ((iEdg‘𝐴)‘𝑗))) = (𝑣 “ ((iEdg‘𝐵)‘(𝑔𝑗))))
12 simplrr 776 . . . . 5 ((((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))
13 f1of 6615 . . . . . . . . 9 (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) → 𝑔:dom (iEdg‘𝐴)⟶dom (iEdg‘𝐵))
14 ffvelrn 6849 . . . . . . . . . 10 ((𝑔:dom (iEdg‘𝐴)⟶dom (iEdg‘𝐵) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → (𝑔𝑗) ∈ dom (iEdg‘𝐵))
1514ex 415 . . . . . . . . 9 (𝑔:dom (iEdg‘𝐴)⟶dom (iEdg‘𝐵) → (𝑗 ∈ dom (iEdg‘𝐴) → (𝑔𝑗) ∈ dom (iEdg‘𝐵)))
1613, 15syl 17 . . . . . . . 8 (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) → (𝑗 ∈ dom (iEdg‘𝐴) → (𝑔𝑗) ∈ dom (iEdg‘𝐵)))
1716adantr 483 . . . . . . 7 ((𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖))) → (𝑗 ∈ dom (iEdg‘𝐴) → (𝑔𝑗) ∈ dom (iEdg‘𝐵)))
1817ad2antlr 725 . . . . . 6 (((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) → (𝑗 ∈ dom (iEdg‘𝐴) → (𝑔𝑗) ∈ dom (iEdg‘𝐵)))
1918imp 409 . . . . 5 ((((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → (𝑔𝑗) ∈ dom (iEdg‘𝐵))
20 fveq2 6670 . . . . . . . 8 (𝑘 = (𝑔𝑗) → ((iEdg‘𝐵)‘𝑘) = ((iEdg‘𝐵)‘(𝑔𝑗)))
2120imaeq2d 5929 . . . . . . 7 (𝑘 = (𝑔𝑗) → (𝑣 “ ((iEdg‘𝐵)‘𝑘)) = (𝑣 “ ((iEdg‘𝐵)‘(𝑔𝑗))))
22 2fveq3 6675 . . . . . . 7 (𝑘 = (𝑔𝑗) → ((iEdg‘𝐶)‘(𝑤𝑘)) = ((iEdg‘𝐶)‘(𝑤‘(𝑔𝑗))))
2321, 22eqeq12d 2837 . . . . . 6 (𝑘 = (𝑔𝑗) → ((𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)) ↔ (𝑣 “ ((iEdg‘𝐵)‘(𝑔𝑗))) = ((iEdg‘𝐶)‘(𝑤‘(𝑔𝑗)))))
2423rspccv 3620 . . . . 5 (∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)) → ((𝑔𝑗) ∈ dom (iEdg‘𝐵) → (𝑣 “ ((iEdg‘𝐵)‘(𝑔𝑗))) = ((iEdg‘𝐶)‘(𝑤‘(𝑔𝑗)))))
2512, 19, 24sylc 65 . . . 4 ((((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → (𝑣 “ ((iEdg‘𝐵)‘(𝑔𝑗))) = ((iEdg‘𝐶)‘(𝑤‘(𝑔𝑗))))
2611, 25eqtrd 2856 . . 3 ((((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → (𝑣 “ (𝑓 “ ((iEdg‘𝐴)‘𝑗))) = ((iEdg‘𝐶)‘(𝑤‘(𝑔𝑗))))
27 f1ofn 6616 . . . . . . . 8 (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) → 𝑔 Fn dom (iEdg‘𝐴))
2827adantr 483 . . . . . . 7 ((𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖))) → 𝑔 Fn dom (iEdg‘𝐴))
2928ad2antlr 725 . . . . . 6 (((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) → 𝑔 Fn dom (iEdg‘𝐴))
30 fvco2 6758 . . . . . 6 ((𝑔 Fn dom (iEdg‘𝐴) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → ((𝑤𝑔)‘𝑗) = (𝑤‘(𝑔𝑗)))
3129, 30sylan 582 . . . . 5 ((((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → ((𝑤𝑔)‘𝑗) = (𝑤‘(𝑔𝑗)))
3231eqcomd 2827 . . . 4 ((((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → (𝑤‘(𝑔𝑗)) = ((𝑤𝑔)‘𝑗))
3332fveq2d 6674 . . 3 ((((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → ((iEdg‘𝐶)‘(𝑤‘(𝑔𝑗))) = ((iEdg‘𝐶)‘((𝑤𝑔)‘𝑗)))
342, 26, 333eqtrd 2860 . 2 ((((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) ∧ 𝑗 ∈ dom (iEdg‘𝐴)) → ((𝑣𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘((𝑤𝑔)‘𝑗)))
3534ralrimiva 3182 1 (((((𝐴 ∈ UHGraph ∧ 𝐵 ∈ UHGraph ∧ 𝐶𝑋) ∧ 𝑓:(Vtx‘𝐴)–1-1-onto→(Vtx‘𝐵) ∧ 𝑣:(Vtx‘𝐵)–1-1-onto→(Vtx‘𝐶)) ∧ (𝑔:dom (iEdg‘𝐴)–1-1-onto→dom (iEdg‘𝐵) ∧ ∀𝑖 ∈ dom (iEdg‘𝐴)(𝑓 “ ((iEdg‘𝐴)‘𝑖)) = ((iEdg‘𝐵)‘(𝑔𝑖)))) ∧ (𝑤:dom (iEdg‘𝐵)–1-1-onto→dom (iEdg‘𝐶) ∧ ∀𝑘 ∈ dom (iEdg‘𝐵)(𝑣 “ ((iEdg‘𝐵)‘𝑘)) = ((iEdg‘𝐶)‘(𝑤𝑘)))) → ∀𝑗 ∈ dom (iEdg‘𝐴)((𝑣𝑓) “ ((iEdg‘𝐴)‘𝑗)) = ((iEdg‘𝐶)‘((𝑤𝑔)‘𝑗)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1083   = wceq 1537  wcel 2114  wral 3138  dom cdm 5555  cima 5558  ccom 5559   Fn wfn 6350  wf 6351  1-1-ontowf1o 6354  cfv 6355  Vtxcvtx 26781  iEdgciedg 26782  UHGraphcuhgr 26841
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-f1o 6362  df-fv 6363
This theorem is referenced by:  isomgrtr  44053
  Copyright terms: Public domain W3C validator