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

Theorem uspgrlim 48352
Description: A local isomorphism of simple pseudographs is a bijection between their vertices that preserves neighborhoods, expressed by properties of their edges (not edge functions as in isgrlim2 48343). (Contributed by AV, 15-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
uspgrlim ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph ∧ 𝐹𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉1-1-onto𝑊 ∧ ∀𝑣𝑉𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))))))
Distinct variable groups:   𝑥,𝐺   𝑥,𝐻   𝑥,𝐼   𝑥,𝐽   𝑥,𝑀   𝑥,𝑁,𝑒   𝑒,𝐺   𝑒,𝐾,𝑥   𝑥,𝐿   𝑒,𝑓,𝑔   𝑓,𝐹,𝑣   𝑓,𝐺,𝑔,𝑣   𝑒,𝐻,𝑓,𝑔,𝑣   𝑔,𝐾   𝑔,𝐿   𝑒,𝑀,𝑓,𝑔   𝑒,𝑁,𝑓,𝑔   𝑣,𝑉   𝑓,𝑍,𝑣   𝑥,𝑔
Allowed substitution hints:   𝐹(𝑥,𝑒,𝑔)   𝐼(𝑣,𝑒,𝑓,𝑔)   𝐽(𝑣,𝑒,𝑓,𝑔)   𝐾(𝑣,𝑓)   𝐿(𝑣,𝑒,𝑓)   𝑀(𝑣)   𝑁(𝑣)   𝑉(𝑥,𝑒,𝑓,𝑔)   𝑊(𝑥,𝑣,𝑒,𝑓,𝑔)   𝑍(𝑥,𝑒,𝑔)

Proof of Theorem uspgrlim
Dummy variables 𝑖 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 uspgrlim.v . . 3 𝑉 = (Vtx‘𝐺)
2 uspgrlim.w . . 3 𝑊 = (Vtx‘𝐻)
3 uspgrlim.n . . 3 𝑁 = (𝐺 ClNeighbVtx 𝑣)
4 uspgrlim.m . . 3 𝑀 = (𝐻 ClNeighbVtx (𝐹𝑣))
5 eqid 2737 . . 3 (iEdg‘𝐺) = (iEdg‘𝐺)
6 eqid 2737 . . 3 (iEdg‘𝐻) = (iEdg‘𝐻)
7 eqid 2737 . . 3 {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}
8 eqid 2737 . . 3 {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} = {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}
91, 2, 3, 4, 5, 6, 7, 8isgrlim2 48343 . 2 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph ∧ 𝐹𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉1-1-onto𝑊 ∧ ∀𝑣𝑉𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃(:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))))))
10 fvex 6855 . . . . . . . . . . . . . 14 (iEdg‘𝐻) ∈ V
11 vex 3446 . . . . . . . . . . . . . 14 ∈ V
1210, 11coex 7882 . . . . . . . . . . . . 13 ((iEdg‘𝐻) ∘ ) ∈ V
13 fvex 6855 . . . . . . . . . . . . . 14 (iEdg‘𝐺) ∈ V
1413cnvex 7877 . . . . . . . . . . . . 13 (iEdg‘𝐺) ∈ V
1512, 14coex 7882 . . . . . . . . . . . 12 (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)) ∈ V
1615a1i 11 . . . . . . . . . . 11 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)) ∈ V)
175uspgrf1oedg 29258 . . . . . . . . . . . . . . 15 (𝐺 ∈ USPGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺))
1817ad2antrr 727 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺))
19 simprl 771 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → :{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀})
206uspgrf1oedg 29258 . . . . . . . . . . . . . . 15 (𝐻 ∈ USPGraph → (iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻))
2120ad2antlr 728 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → (iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻))
22 ssrab2 4034 . . . . . . . . . . . . . . . 16 {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} ⊆ dom (iEdg‘𝐺)
23 ssrab2 4034 . . . . . . . . . . . . . . . 16 {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ⊆ dom (iEdg‘𝐻)
2422, 23pm3.2i 470 . . . . . . . . . . . . . . 15 ({𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} ⊆ dom (iEdg‘𝐺) ∧ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ⊆ dom (iEdg‘𝐻))
2524a1i 11 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → ({𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} ⊆ dom (iEdg‘𝐺) ∧ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ⊆ dom (iEdg‘𝐻)))
26 3f1oss1 47435 . . . . . . . . . . . . . 14 ((((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺) ∧ :{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ (iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻)) ∧ ({𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} ⊆ dom (iEdg‘𝐺) ∧ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ⊆ dom (iEdg‘𝐻))) → (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)):((iEdg‘𝐺) “ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁})–1-1-onto→((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}))
2718, 19, 21, 25, 26syl31anc 1376 . . . . . . . . . . . . 13 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)):((iEdg‘𝐺) “ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁})–1-1-onto→((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}))
28 eqidd 2738 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)) = (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)))
29 uspgrlim.i . . . . . . . . . . . . . . . 16 𝐼 = (Edg‘𝐺)
30 uspgrlim.k . . . . . . . . . . . . . . . 16 𝐾 = {𝑥𝐼𝑥𝑁}
313, 29, 30uspgrlimlem1 48348 . . . . . . . . . . . . . . 15 (𝐺 ∈ USPGraph → 𝐾 = ((iEdg‘𝐺) “ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}))
3231ad2antrr 727 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → 𝐾 = ((iEdg‘𝐺) “ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}))
33 uspgrlim.j . . . . . . . . . . . . . . . 16 𝐽 = (Edg‘𝐻)
34 uspgrlim.l . . . . . . . . . . . . . . . 16 𝐿 = {𝑥𝐽𝑥𝑀}
354, 33, 34uspgrlimlem1 48348 . . . . . . . . . . . . . . 15 (𝐻 ∈ USPGraph → 𝐿 = ((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}))
3635ad2antlr 728 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → 𝐿 = ((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}))
3728, 32, 36f1oeq123d 6776 . . . . . . . . . . . . 13 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → ((((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)):𝐾1-1-onto𝐿 ↔ (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)):((iEdg‘𝐺) “ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁})–1-1-onto→((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀})))
3827, 37mpbird 257 . . . . . . . . . . . 12 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)):𝐾1-1-onto𝐿)
39 simpll 767 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → 𝐺 ∈ USPGraph)
40 simprr 773 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))
411, 2, 3, 4, 29, 33, 30, 34uspgrlimlem3 48350 . . . . . . . . . . . . . 14 ((𝐺 ∈ USPGraph ∧ :{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖))) → (𝑒𝐾 → (𝑓𝑒) = ((((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺))‘𝑒)))
4239, 19, 40, 41syl3anc 1374 . . . . . . . . . . . . 13 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → (𝑒𝐾 → (𝑓𝑒) = ((((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺))‘𝑒)))
4342ralrimiv 3129 . . . . . . . . . . . 12 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → ∀𝑒𝐾 (𝑓𝑒) = ((((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺))‘𝑒))
4438, 43jca 511 . . . . . . . . . . 11 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → ((((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)):𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = ((((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺))‘𝑒)))
45 f1oeq1 6770 . . . . . . . . . . . 12 (𝑔 = (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)) → (𝑔:𝐾1-1-onto𝐿 ↔ (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)):𝐾1-1-onto𝐿))
46 fveq1 6841 . . . . . . . . . . . . . 14 (𝑔 = (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)) → (𝑔𝑒) = ((((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺))‘𝑒))
4746eqeq2d 2748 . . . . . . . . . . . . 13 (𝑔 = (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)) → ((𝑓𝑒) = (𝑔𝑒) ↔ (𝑓𝑒) = ((((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺))‘𝑒)))
4847ralbidv 3161 . . . . . . . . . . . 12 (𝑔 = (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)) → (∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒) ↔ ∀𝑒𝐾 (𝑓𝑒) = ((((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺))‘𝑒)))
4945, 48anbi12d 633 . . . . . . . . . . 11 (𝑔 = (((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)) → ((𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒)) ↔ ((((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺)):𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = ((((iEdg‘𝐻) ∘ ) ∘ (iEdg‘𝐺))‘𝑒))))
5016, 44, 49spcedv 3554 . . . . . . . . . 10 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) → ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒)))
5150ex 412 . . . . . . . . 9 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → ((:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖))) → ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))))
5251exlimdv 1935 . . . . . . . 8 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → (∃(:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖))) → ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))))
5310cnvex 7877 . . . . . . . . . . . . . 14 (iEdg‘𝐻) ∈ V
54 vex 3446 . . . . . . . . . . . . . 14 𝑔 ∈ V
5553, 54coex 7882 . . . . . . . . . . . . 13 ((iEdg‘𝐻) ∘ 𝑔) ∈ V
5655, 13coex 7882 . . . . . . . . . . . 12 (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)) ∈ V
5756a1i 11 . . . . . . . . . . 11 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)) ∈ V)
5817ad2antrr 727 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺))
59 simprl 771 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → 𝑔:𝐾1-1-onto𝐿)
6020ad2antlr 728 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → (iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻))
6129rabeqi 3414 . . . . . . . . . . . . . . . . . 18 {𝑥𝐼𝑥𝑁} = {𝑥 ∈ (Edg‘𝐺) ∣ 𝑥𝑁}
6230, 61eqtri 2760 . . . . . . . . . . . . . . . . 17 𝐾 = {𝑥 ∈ (Edg‘𝐺) ∣ 𝑥𝑁}
6362ssrab3 4036 . . . . . . . . . . . . . . . 16 𝐾 ⊆ (Edg‘𝐺)
6433rabeqi 3414 . . . . . . . . . . . . . . . . . 18 {𝑥𝐽𝑥𝑀} = {𝑥 ∈ (Edg‘𝐻) ∣ 𝑥𝑀}
6534, 64eqtri 2760 . . . . . . . . . . . . . . . . 17 𝐿 = {𝑥 ∈ (Edg‘𝐻) ∣ 𝑥𝑀}
6665ssrab3 4036 . . . . . . . . . . . . . . . 16 𝐿 ⊆ (Edg‘𝐻)
6763, 66pm3.2i 470 . . . . . . . . . . . . . . 15 (𝐾 ⊆ (Edg‘𝐺) ∧ 𝐿 ⊆ (Edg‘𝐻))
6867a1i 11 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → (𝐾 ⊆ (Edg‘𝐺) ∧ 𝐿 ⊆ (Edg‘𝐻)))
69 3f1oss2 47436 . . . . . . . . . . . . . 14 ((((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1-onto→(Edg‘𝐺) ∧ 𝑔:𝐾1-1-onto𝐿 ∧ (iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻)) ∧ (𝐾 ⊆ (Edg‘𝐺) ∧ 𝐿 ⊆ (Edg‘𝐻))) → (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)):((iEdg‘𝐺) “ 𝐾)–1-1-onto→((iEdg‘𝐻) “ 𝐿))
7058, 59, 60, 68, 69syl31anc 1376 . . . . . . . . . . . . 13 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)):((iEdg‘𝐺) “ 𝐾)–1-1-onto→((iEdg‘𝐻) “ 𝐿))
71 eqidd 2738 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)) = (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)))
723, 29, 30uspgrlimlem2 48349 . . . . . . . . . . . . . . 15 (𝐺 ∈ USPGraph → ((iEdg‘𝐺) “ 𝐾) = {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁})
7372ad2antrr 727 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → ((iEdg‘𝐺) “ 𝐾) = {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁})
744, 33, 34uspgrlimlem2 48349 . . . . . . . . . . . . . . 15 (𝐻 ∈ USPGraph → ((iEdg‘𝐻) “ 𝐿) = {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀})
7574ad2antlr 728 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → ((iEdg‘𝐻) “ 𝐿) = {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀})
7671, 73, 75f1oeq123d 6776 . . . . . . . . . . . . 13 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → ((((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)):((iEdg‘𝐺) “ 𝐾)–1-1-onto→((iEdg‘𝐻) “ 𝐿) ↔ (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)):{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}))
7770, 76mpbid 232 . . . . . . . . . . . 12 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)):{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀})
78 fveq2 6842 . . . . . . . . . . . . . . . 16 (𝑥 = 𝑖 → ((iEdg‘𝐺)‘𝑥) = ((iEdg‘𝐺)‘𝑖))
7978sseq1d 3967 . . . . . . . . . . . . . . 15 (𝑥 = 𝑖 → (((iEdg‘𝐺)‘𝑥) ⊆ 𝑁 ↔ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁))
8079elrab 3648 . . . . . . . . . . . . . 14 (𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} ↔ (𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁))
811, 2, 3, 4, 29, 33, 30, 34uspgrlimlem4 48351 . . . . . . . . . . . . . 14 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → ((𝑖 ∈ dom (iEdg‘𝐺) ∧ ((iEdg‘𝐺)‘𝑖) ⊆ 𝑁) → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖))))
8280, 81biimtrid 242 . . . . . . . . . . . . 13 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → (𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} → (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖))))
8382ralrimiv 3129 . . . . . . . . . . . 12 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖)))
8477, 83jca 511 . . . . . . . . . . 11 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → ((((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)):{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖))))
85 f1oeq1 6770 . . . . . . . . . . . 12 ( = (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)) → (:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ↔ (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)):{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}))
86 fveq1 6841 . . . . . . . . . . . . . . 15 ( = (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)) → (𝑖) = ((((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖))
8786fveq2d 6846 . . . . . . . . . . . . . 14 ( = (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)) → ((iEdg‘𝐻)‘(𝑖)) = ((iEdg‘𝐻)‘((((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖)))
8887eqeq2d 2748 . . . . . . . . . . . . 13 ( = (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)) → ((𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)) ↔ (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖))))
8988ralbidv 3161 . . . . . . . . . . . 12 ( = (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)) → (∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)) ↔ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖))))
9085, 89anbi12d 633 . . . . . . . . . . 11 ( = (((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)) → ((:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖))) ↔ ((((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺)):{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘((((iEdg‘𝐻) ∘ 𝑔) ∘ (iEdg‘𝐺))‘𝑖)))))
9157, 84, 90spcedv 3554 . . . . . . . . . 10 (((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) ∧ (𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))) → ∃(:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖))))
9291ex 412 . . . . . . . . 9 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → ((𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒)) → ∃(:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))))
9392exlimdv 1935 . . . . . . . 8 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → (∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒)) → ∃(:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))))
9452, 93impbid 212 . . . . . . 7 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → (∃(:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖))) ↔ ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))))
9594anbi2d 631 . . . . . 6 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → ((𝑓:𝑁1-1-onto𝑀 ∧ ∃(:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) ↔ (𝑓:𝑁1-1-onto𝑀 ∧ ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒)))))
9695exbidv 1923 . . . . 5 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → (∃𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃(:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) ↔ ∃𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒)))))
9796ralbidv 3161 . . . 4 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → (∀𝑣𝑉𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃(:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖)))) ↔ ∀𝑣𝑉𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒)))))
9897anbi2d 631 . . 3 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph) → ((𝐹:𝑉1-1-onto𝑊 ∧ ∀𝑣𝑉𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃(:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖))))) ↔ (𝐹:𝑉1-1-onto𝑊 ∧ ∀𝑣𝑉𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))))))
99983adant3 1133 . 2 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph ∧ 𝐹𝑍) → ((𝐹:𝑉1-1-onto𝑊 ∧ ∀𝑣𝑉𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃(:{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁}–1-1-onto→{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ∧ ∀𝑖 ∈ {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) ⊆ 𝑁} (𝑓 “ ((iEdg‘𝐺)‘𝑖)) = ((iEdg‘𝐻)‘(𝑖))))) ↔ (𝐹:𝑉1-1-onto𝑊 ∧ ∀𝑣𝑉𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))))))
1009, 99bitrd 279 1 ((𝐺 ∈ USPGraph ∧ 𝐻 ∈ USPGraph ∧ 𝐹𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉1-1-onto𝑊 ∧ ∀𝑣𝑉𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑒𝐾 (𝑓𝑒) = (𝑔𝑒))))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wex 1781  wcel 2114  wral 3052  {crab 3401  Vcvv 3442  wss 3903  ccnv 5631  dom cdm 5632  cima 5635  ccom 5636  1-1-ontowf1o 6499  cfv 6500  (class class class)co 7368  Vtxcvtx 29081  iEdgciedg 29082  Edgcedg 29132  USPGraphcuspgr 29233   ClNeighbVtx cclnbgr 48178   GraphLocIso cgrlim 48336
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-1o 8407  df-map 8777  df-vtx 29083  df-iedg 29084  df-edg 29133  df-uspgr 29235  df-clnbgr 48179  df-isubgr 48221  df-grim 48238  df-gric 48241  df-grlim 48338
This theorem is referenced by:  usgrlimprop  48353
  Copyright terms: Public domain W3C validator