Theorem isgrlim2 49175

Description: A local isomorphism of graphs is a bijection between their vertices that preserves neighborhoods. Definitions expanded. (Contributed by AV, 29-May-2025.)

Hypotheses

Ref	Expression
isgrlim.v	⊢ 𝑉 = (Vtx‘𝐺)
isgrlim.w	⊢ 𝑊 = (Vtx‘𝐻)
isgrlim2.n	⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑣)
isgrlim2.m	⊢ 𝑀 = (𝐻 ClNeighbVtx (𝐹‘𝑣))
isgrlim2.i	⊢ 𝐼 = (iEdg‘𝐺)
isgrlim2.j	⊢ 𝐽 = (iEdg‘𝐻)
isgrlim2.k	⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
isgrlim2.l	⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}

Assertion

Ref	Expression
isgrlim2	⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))

Distinct variable groups:   𝑓,𝐹,𝑔,𝑣   𝑓,𝐺,𝑔,𝑣   𝑓,𝐻,𝑔,𝑣   𝑣,𝑉   𝑓,𝑋,𝑔   𝑓,𝑌,𝑔   𝑓,𝑍,𝑔   𝑖,𝐺   𝑥,𝐺   𝑖,𝐻   𝑥,𝐻   𝑥,𝐼   𝑥,𝐽   𝑖,𝐾   𝑖,𝐿   𝑓,𝑀,𝑔,𝑖   𝑥,𝑀   𝑓,𝑁,𝑔,𝑖   𝑥,𝑁   𝑖,𝑋,𝑣   𝑖,𝑌,𝑣   𝑣,𝑍

Allowed substitution hints:   𝐹(𝑥, 𝑖)   𝐼(𝑣, 𝑓, 𝑔, 𝑖)   𝐽(𝑣, 𝑓, 𝑔, 𝑖)   𝐾(𝑥, 𝑣, 𝑓, 𝑔)   𝐿(𝑥, 𝑣, 𝑓, 𝑔)   𝑀(𝑣)   𝑁(𝑣)   𝑉(𝑥, 𝑓, 𝑔, 𝑖)   𝑊(𝑥, 𝑣, 𝑓, 𝑔, 𝑖)   𝑋(𝑥)   𝑌(𝑥)   𝑍(𝑥, 𝑖)

Proof of Theorem isgrlim2

Step	Hyp	Ref	Expression
1		isgrlim.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2		isgrlim.w	. . 3 ⊢ 𝑊 = (Vtx‘𝐻)
3	1, 2	isgrlim 49174	. 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))))))
4		isgrlim2.n	. . . . . . . . 9 ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑣)
5	4	eqcomi 2769	. . . . . . . 8 ⊢ (𝐺 ClNeighbVtx 𝑣) = 𝑁
6	5	oveq2i 7432	. . . . . . 7 ⊢ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) = (𝐺 ISubGr 𝑁)
7		isgrlim2.m	. . . . . . . . 9 ⊢ 𝑀 = (𝐻 ClNeighbVtx (𝐹‘𝑣))
8	7	eqcomi 2769	. . . . . . . 8 ⊢ (𝐻 ClNeighbVtx (𝐹‘𝑣)) = 𝑀
9	8	oveq2i 7432	. . . . . . 7 ⊢ (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) = (𝐻 ISubGr 𝑀)
10	6, 9	breq12i 5111	. . . . . 6 ⊢ ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ (𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀))
11	10	a1i 11	. . . . 5 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ (𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀)))
12		isgrlim2.i	. . . . . . 7 ⊢ 𝐼 = (iEdg‘𝐺)
13		isgrlim2.j	. . . . . . 7 ⊢ 𝐽 = (iEdg‘𝐻)
14		isgrlim2.k	. . . . . . 7 ⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
15		isgrlim2.l	. . . . . . 7 ⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}
16	12, 13, 4, 7, 14, 15	clnbgrisubgrgrim 49124	. . . . . 6 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
17	16	3adant3 1150	. . . . 5 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
18	11, 17	bitrd 282	. . . 4 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
19	18	ralbidv 3185	. . 3 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
20	19	anbi2d 642	. 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣)))) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))
21	3, 20	bitrd 282	1 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∀wral 3076  {crab 3412   ⊆ wss 3895   class class class wbr 5102  dom cdm 5650   “ cima 5653  –1-1-onto→wf1o 6538  ‘cfv 6539  (class class class)co 7421  Vtxcvtx 29580  iEdgciedg 29581   ClNeighbVtx cclnbgr 49010   ISubGr cisubgr 49052   ≃_𝑔𝑟 cgric 49068   GraphLocIso cgrlim 49168

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-1st 8002  df-2nd 8003  df-1o 8480  df-map 8853  df-vtx 29582  df-iedg 29583  df-clnbgr 49011  df-isubgr 49053  df-grim 49070  df-gric 49073  df-grlim 49170

This theorem is used by:  grlimprop2  49178  uspgrlim  49184  dfgrlic3  49202