Metamath Proof Explorer


Theorem grlimprclnbgrvtx

Description: For two locally isomorphic graphs G and H and a vertex A of G there is a bijection f mapping the closed neighborhood N of A onto the closed neighborhood M of ( FA ) , so that the mapped vertices of an edge { A , B } containing the vertex A is an edge between the vertices in M containing the vertex ( FA ) . (Contributed by AV, 28-Dec-2025)

Ref Expression
Hypotheses clnbgrvtxedg.n N = G ClNeighbVtx A
clnbgrvtxedg.i I = Edg G
clnbgrvtxedg.k K = x I | x N
grlimedgclnbgr.m M = H ClNeighbVtx F A
grlimedgclnbgr.j J = Edg H
grlimedgclnbgr.l L = x J | x M
Assertion grlimprclnbgrvtx G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f f : N 1-1 onto M F A f B L F A f A L

Proof

Step Hyp Ref Expression
1 clnbgrvtxedg.n N = G ClNeighbVtx A
2 clnbgrvtxedg.i I = Edg G
3 clnbgrvtxedg.k K = x I | x N
4 grlimedgclnbgr.m M = H ClNeighbVtx F A
5 grlimedgclnbgr.j J = Edg H
6 grlimedgclnbgr.l L = x J | x M
7 1 2 3 4 5 6 grlimprclnbgredg G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f f : N 1-1 onto M f A f B L
8 simprl G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f : N 1-1 onto M
9 sseq1 x = f A f B x M f A f B M
10 9 6 elrab2 f A f B L f A f B J f A f B M
11 10 bilani f : N 1-1 onto M f A f B L f A f B J f A f B M
12 11 adantl G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A f B M
13 fvex f A V
14 fvex f B V
15 13 14 prss f A M f B M f A f B M
16 uspgrupgr H USHGraph H UPGraph
17 16 adantl G USHGraph H USHGraph H UPGraph
18 17 3ad2ant1 G USHGraph H USHGraph F G GraphLocIso H A V B W A B I H UPGraph
19 18 ad2antrr G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J H UPGraph
20 4 eleq2i f A M f A H ClNeighbVtx F A
21 5 clnbupgreli H UPGraph f A H ClNeighbVtx F A f A = F A f A F A J
22 21 ex H UPGraph f A H ClNeighbVtx F A f A = F A f A F A J
23 20 22 biimtrid H UPGraph f A M f A = F A f A F A J
24 4 eleq2i f B M f B H ClNeighbVtx F A
25 5 clnbupgreli H UPGraph f B H ClNeighbVtx F A f B = F A f B F A J
26 25 ex H UPGraph f B H ClNeighbVtx F A f B = F A f B F A J
27 24 26 biimtrid H UPGraph f B M f B = F A f B F A J
28 23 27 anim12d H UPGraph f A M f B M f A = F A f A F A J f B = F A f B F A J
29 19 28 syl G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f A = F A f A F A J f B = F A f B F A J
30 29 imp G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f A = F A f A F A J f B = F A f B F A J
31 prcom f A f B = f B f A
32 preq1 f B = F A f B f A = F A f A
33 31 32 eqtrid f B = F A f A f B = F A f A
34 33 eleq1d f B = F A f A f B L F A f A L
35 34 biimpcd f A f B L f B = F A F A f A L
36 35 adantl f : N 1-1 onto M f A f B L f B = F A F A f A L
37 36 adantl G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f B = F A F A f A L
38 37 ad2antrr G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B = F A F A f A L
39 prcom f B F A = F A f B
40 39 eleq1i f B F A J F A f B J
41 40 bilani G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B F A J F A f B J
42 19 ad2antrr G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B F A J H UPGraph
43 fvex F A V
44 14 43 pm3.2i f B V F A V
45 44 a1i G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B F A J f B V F A V
46 simpr G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B F A J f B F A J
47 42 45 46 3jca G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B F A J H UPGraph f B V F A V f B F A J
48 eqid Vtx H = Vtx H
49 48 5 upgrpredgv H UPGraph f B V F A V f B F A J f B Vtx H F A Vtx H
50 simpr f B Vtx H F A Vtx H F A Vtx H
51 47 49 50 3syl G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B F A J F A Vtx H
52 48 clnbgrvtxel F A Vtx H F A H ClNeighbVtx F A
53 4 eleq2i F A M F A H ClNeighbVtx F A
54 52 53 sylibr F A Vtx H F A M
55 51 54 syl G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B F A J F A M
56 simplrr G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B F A J f B M
57 55 56 prssd G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B F A J F A f B M
58 sseq1 x = F A f B x M F A f B M
59 58 6 elrab2 F A f B L F A f B J F A f B M
60 41 57 59 sylanbrc G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B F A J F A f B L
61 60 ex G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B F A J F A f B L
62 38 61 orim12d G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B = F A f B F A J F A f A L F A f B L
63 62 imp G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B = F A f B F A J F A f A L F A f B L
64 63 orcomd G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B = F A f B F A J F A f B L F A f A L
65 64 ex G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f B = F A f B F A J F A f B L F A f A L
66 65 adantld G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M f A = F A f A F A J f B = F A f B F A J F A f B L F A f A L
67 30 66 mpd G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M F A f B L F A f A L
68 67 ex G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A M f B M F A f B L F A f A L
69 15 68 biimtrrid G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A f B M F A f B L F A f A L
70 69 expimpd G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f A f B J f A f B M F A f B L F A f A L
71 12 70 mpd G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L F A f B L F A f A L
72 8 71 jca G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f : N 1-1 onto M F A f B L F A f A L
73 72 ex G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f : N 1-1 onto M f A f B L f : N 1-1 onto M F A f B L F A f A L
74 73 eximdv G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f f : N 1-1 onto M f A f B L f f : N 1-1 onto M F A f B L F A f A L
75 7 74 mpd G USHGraph H USHGraph F G GraphLocIso H A V B W A B I f f : N 1-1 onto M F A f B L F A f A L