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

Theorem uspgrlimlem4 49362
Description: Lemma 4 for uspgrlim 49363. (Contributed by AV, 16-Aug-2025.)
Hypotheses
Ref Expression
uspgrlim.v 𝑉 = (Vtx‘𝐺)
uspgrlim.w 𝑊 = (Vtx‘𝐻)
uspgrlim.n 𝑁 = (𝐺 ClNeighbVtx 𝑣)
uspgrlim.m 𝑀 = (𝐻 ClNeighbVtx (𝐹‘𝑣))
uspgrlim.i 𝐼 = (Edg‘𝐺)
uspgrlim.j 𝐽 = (Edg‘𝐻)
uspgrlim.k 𝐾 = {𝑥 ∈ 𝐼 ∣ 𝑥 ⊆ 𝑁}
uspgrlim.l 𝐿 = {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀}
Assertion
Ref Expression
uspgrlimlem4 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) → ((𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(((◡(iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖))))
Distinct variable groups:   𝑖,𝐺,𝑥   𝑖,𝐻,𝑥   𝑥,𝐼   𝑥,𝐽   𝑥,𝑀   𝑖,𝑁,𝑥   𝑒,𝑖,𝑥   𝑓,𝑖   𝑒,𝐺   𝑒,𝐾,𝑥   𝑥,𝐿   𝑒,𝑓   𝑒,𝑔
Allowed substitution hints:   𝐹(𝑥, 𝑣, 𝑒, 𝑓, 𝑔, 𝑖)   𝐺(𝑣, 𝑓, 𝑔)   𝐻(𝑣, 𝑒, 𝑓, 𝑔)   𝐼(𝑣, 𝑒, 𝑓, 𝑔, 𝑖)   𝐽(𝑣, 𝑒, 𝑓, 𝑔, 𝑖)   𝐾(𝑣, 𝑓, 𝑔, 𝑖)   𝐿(𝑣, 𝑒, 𝑓, 𝑔, 𝑖)   𝑀(𝑣, 𝑒, 𝑓, 𝑔, 𝑖)   𝑁(𝑣, 𝑒, 𝑓, 𝑔)   𝑉(𝑥, 𝑣, 𝑒, 𝑓, 𝑔, 𝑖)   𝑊(𝑥, 𝑣, 𝑒, 𝑓, 𝑔, 𝑖)

Proof of Theorem uspgrlimlem4
StepHypRef Expression
1 eqid 2763 . . . . . . 7 (iEdg‘𝐺) = (iEdg‘𝐺)
21uspgrf1oedg 29811 . . . . . 6 (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶1-1onto(Edg‘𝐺))
3 f1of 6854 . . . . . 6 ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶1-1onto(Edg‘𝐺) → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(Edg‘𝐺))
42, 3syl 18 . . . . 5 (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(Edg‘𝐺))
54ad2antrr 739 . . . 4 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(Edg‘𝐺))
6 simpl 488 . . . 4 ((𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁) → 𝑖 ∈ dom (iEdg‘𝐺))
7 fvco3 7016 . . . . 5 (((iEdg‘𝐺):dom (iEdg‘𝐺)⟶(Edg‘𝐺) ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → (((◡(iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖) = ((◡(iEdg‘𝐻) ∘ 𝑔)‘((iEdg‘𝐺)‘𝑖)))
87fveq2d 6920 . . . 4 (((iEdg‘𝐺):dom (iEdg‘𝐺)⟶(Edg‘𝐺) ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐻)‘(((◡(iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖)) = ((iEdg‘𝐻)‘((◡(iEdg‘𝐻) ∘ 𝑔)‘((iEdg‘𝐺)‘𝑖))))
95, 6, 8syl2an 608 . . 3 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → ((iEdg‘𝐻)‘(((◡(iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖)) = ((iEdg‘𝐻)‘((◡(iEdg‘𝐻) ∘ 𝑔)‘((iEdg‘𝐺)‘𝑖))))
10 eqid 2763 . . . . . . 7 (iEdg‘𝐻) = (iEdg‘𝐻)
1110uspgrf1oedg 29811 . . . . . 6 (𝐻 ∈ USPGraph → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶1-1onto(Edg‘𝐻))
1211ad3antlr 744 . . . . 5 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶1-1onto(Edg‘𝐻))
13 ssrab2 4008 . . . . . . 7 {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀} ⊆ 𝐽
14 uspgrlim.l . . . . . . 7 𝐿 = {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀}
15 uspgrlim.j . . . . . . . 8 𝐽 = (Edg‘𝐻)
1615eqcomi 2772 . . . . . . 7 (Edg‘𝐻) = 𝐽
1713, 14, 163sstr4i 3964 . . . . . 6 𝐿 ⊆ (Edg‘𝐻)
18 f1of 6854 . . . . . . . . . 10 (𝑔:𝐾⟶1-1onto𝐿 → 𝑔:𝐾⟶𝐿)
1918adantr 486 . . . . . . . . 9 ((𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒)) → 𝑔:𝐾⟶𝐿)
2019adantl 487 . . . . . . . 8 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) → 𝑔:𝐾⟶𝐿)
2120adantr 486 . . . . . . 7 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → 𝑔:𝐾⟶𝐿)
225ffund 6744 . . . . . . . . . 10 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) → Fun (iEdg‘𝐺))
231iedgedg 29685 . . . . . . . . . 10 ((Fun (iEdg‘𝐺) ∧ 𝑖 ∈ dom (iEdg‘𝐺)) → ((iEdg‘𝐺)‘𝑖) ∈ (Edg‘𝐺))
2422, 6, 23syl2an 608 . . . . . . . . 9 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → ((iEdg‘𝐺)‘𝑖) ∈ (Edg‘𝐺))
25 uspgrlim.i . . . . . . . . 9 𝐼 = (Edg‘𝐺)
2624, 25eleqtrrdi 2875 . . . . . . . 8 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → ((iEdg‘𝐺)‘𝑖) ∈ 𝐼)
27 simprr 785 . . . . . . . 8 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)
28 sseq1 3938 . . . . . . . . 9 (𝑥 = ((iEdg‘𝐺)‘𝑖) → (𝑥 ⊆ 𝑁 ↔ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁))
29 uspgrlim.k . . . . . . . . 9 𝐾 = {𝑥 ∈ 𝐼 ∣ 𝑥 ⊆ 𝑁}
3028, 29elrab2 3652 . . . . . . . 8 (((iEdg‘𝐺)‘𝑖) ∈ 𝐾 ↔ (((iEdg‘𝐺)‘𝑖) ∈ 𝐼 ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁))
3126, 27, 30sylanbrc 595 . . . . . . 7 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → ((iEdg‘𝐺)‘𝑖) ∈ 𝐾)
3221, 31ffvelcdmd 7117 . . . . . 6 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → (𝑔‘((iEdg‘𝐺)‘𝑖)) ∈ 𝐿)
3317, 32sselid 3911 . . . . 5 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → (𝑔‘((iEdg‘𝐺)‘𝑖)) ∈ (Edg‘𝐻))
34 f1ocnvfv2 7316 . . . . 5 (((iEdg‘𝐻):dom (iEdg‘𝐻)⟶1-1onto(Edg‘𝐻) ∧ (𝑔‘((iEdg‘𝐺)‘𝑖)) ∈ (Edg‘𝐻)) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘(𝑔‘((iEdg‘𝐺)‘𝑖)))) = (𝑔‘((iEdg‘𝐺)‘𝑖)))
3512, 33, 34syl2anc 596 . . . 4 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘(𝑔‘((iEdg‘𝐺)‘𝑖)))) = (𝑔‘((iEdg‘𝐺)‘𝑖)))
36 fvco3 7016 . . . . . 6 ((𝑔:𝐾⟶𝐿 ∧ ((iEdg‘𝐺)‘𝑖) ∈ 𝐾) → ((◡(iEdg‘𝐻) ∘ 𝑔)‘((iEdg‘𝐺)‘𝑖)) = (◡(iEdg‘𝐻)‘(𝑔‘((iEdg‘𝐺)‘𝑖))))
3736fveq2d 6920 . . . . 5 ((𝑔:𝐾⟶𝐿 ∧ ((iEdg‘𝐺)‘𝑖) ∈ 𝐾) → ((iEdg‘𝐻)‘((◡(iEdg‘𝐻) ∘ 𝑔)‘((iEdg‘𝐺)‘𝑖))) = ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘(𝑔‘((iEdg‘𝐺)‘𝑖)))))
3821, 31, 37syl2anc 596 . . . 4 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → ((iEdg‘𝐻)‘((◡(iEdg‘𝐻) ∘ 𝑔)‘((iEdg‘𝐺)‘𝑖))) = ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘(𝑔‘((iEdg‘𝐺)‘𝑖)))))
3925eqcomi 2772 . . . . . . . . . . . . . . 15 (Edg‘𝐺) = 𝐼
40 feq3 6719 . . . . . . . . . . . . . . 15 ((Edg‘𝐺) = 𝐼 → ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶(Edg‘𝐺) ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶𝐼))
4139, 40ax-mp 5 . . . . . . . . . . . . . 14 ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶(Edg‘𝐺) ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)⟶𝐼)
4241biimpi 219 . . . . . . . . . . . . 13 ((iEdg‘𝐺):dom (iEdg‘𝐺)⟶(Edg‘𝐺) → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶𝐼)
432, 3, 423syl 19 . . . . . . . . . . . 12 (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶𝐼)
4443ad2antrr 739 . . . . . . . . . . 11 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶𝐼)
456adantl 487 . . . . . . . . . . 11 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → 𝑖 ∈ dom (iEdg‘𝐺))
4644, 45ffvelcdmd 7117 . . . . . . . . . 10 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → ((iEdg‘𝐺)‘𝑖) ∈ 𝐼)
47 simprr 785 . . . . . . . . . 10 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)
4846, 47, 30sylanbrc 595 . . . . . . . . 9 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → ((iEdg‘𝐺)‘𝑖) ∈ 𝐾)
49 imaeq2 6066 . . . . . . . . . . 11 (𝑒 = ((iEdg‘𝐺)‘𝑖) → (𝑓 “ 𝑒) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)))
50 fveq2 6916 . . . . . . . . . . 11 (𝑒 = ((iEdg‘𝐺)‘𝑖) → (𝑔‘𝑒) = (𝑔‘((iEdg‘𝐺)‘𝑖)))
5149, 50eqeq12d 2779 . . . . . . . . . 10 (𝑒 = ((iEdg‘𝐺)‘𝑖) → ((𝑓 “ 𝑒) = (𝑔‘𝑒) ↔ (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = (𝑔‘((iEdg‘𝐺)‘𝑖))))
5251rspcv 3576 . . . . . . . . 9 (((iEdg‘𝐺)‘𝑖) ∈ 𝐾 → (∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = (𝑔‘((iEdg‘𝐺)‘𝑖))))
5348, 52syl 18 . . . . . . . 8 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → (∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = (𝑔‘((iEdg‘𝐺)‘𝑖))))
5453ex 418 . . . . . . 7 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → ((𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁) → (∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = (𝑔‘((iEdg‘𝐺)‘𝑖)))))
5554com23 87 . . . . . 6 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → (∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒) → ((𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = (𝑔‘((iEdg‘𝐺)‘𝑖)))))
5655adantld 496 . . . . 5 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → ((𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒)) → ((𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = (𝑔‘((iEdg‘𝐺)‘𝑖)))))
5756imp31 423 . . . 4 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = (𝑔‘((iEdg‘𝐺)‘𝑖)))
5835, 38, 573eqtr4d 2808 . . 3 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → ((iEdg‘𝐻)‘((◡(iEdg‘𝐻) ∘ 𝑔)‘((iEdg‘𝐺)‘𝑖))) = (𝑓 “ ((iEdg‘𝐺)‘𝑖)))
599, 58eqtr2d 2799 . 2 ((((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁)) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(((◡(iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖)))
6059ex 418 1 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑒 ∈ 𝐾 (𝑓 “ 𝑒) = (𝑔‘𝑒))) → ((𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(((◡(iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   ⊆ wss 3900  ◡ccnv 5657  dom cdm 5658   “ cima 5661   ∘ ccom 5662  Fun wfun 6560  ⟶wf 6562  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451  Vtxcvtx 29631  iEdgciedg 29632  Edgcedg 29682  USPGraphcuspgr 29786   ClNeighbVtx cclnbgr 49189
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-edg 29683  df-uspgr 29788
This theorem is used by:  uspgrlim  49363
  Copyright terms: Public domain W3C validator