Theorem clnbgr3stgrgrlim 48507

Description: If all (closed) neighborhoods of the vertices in two simple graphs with the same order induce a subgraph which is isomorphic to an 𝑁-star, then any bijection between the vertices is a local isomorphism between the two graphs. (Contributed by AV, 28-Dec-2025.)

Hypotheses

Ref	Expression
clnbgr3stgrgrlim.n	⊢ 𝑁 ∈ ℕ0
clnbgr3stgrgrlim.v	⊢ 𝑉 = (Vtx‘𝐺)
clnbgr3stgrgrlim.w	⊢ 𝑊 = (Vtx‘𝐻)

Assertion

Ref	Expression
clnbgr3stgrgrlim	⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → 𝐹 ∈ (𝐺 GraphLocIso 𝐻))

Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐺   𝑥,𝐻,𝑦   𝑥,𝑁,𝑦   𝑥,𝑉   𝑥,𝑊,𝑦

Allowed substitution hints:   𝐺(𝑦)   𝑉(𝑦)

Proof of Theorem clnbgr3stgrgrlim

Step	Hyp	Ref	Expression
1		simp13 1207	. 2 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → 𝐹:𝑉–1-1-onto→𝑊)
2		usgruhgr 29269	. . . . . . . . . . . . 13 ⊢ (𝐻 ∈ USGraph → 𝐻 ∈ UHGraph)
3	2	3ad2ant2 1135	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) → 𝐻 ∈ UHGraph)
4	3	adantr 480	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → 𝐻 ∈ UHGraph)
5		clnbgr3stgrgrlim.w	. . . . . . . . . . . . 13 ⊢ 𝑊 = (Vtx‘𝐻)
6	5	clnbgrssvtx 48319	. . . . . . . . . . . 12 ⊢ (𝐻 ClNeighbVtx (𝐹‘𝑥)) ⊆ 𝑊
7	6	a1i 11	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) → (𝐻 ClNeighbVtx (𝐹‘𝑥)) ⊆ 𝑊)
8	5	isubgruhgr 48356	. . . . . . . . . . 11 ⊢ ((𝐻 ∈ UHGraph ∧ (𝐻 ClNeighbVtx (𝐹‘𝑥)) ⊆ 𝑊) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ∈ UHGraph)
9	4, 7, 8	syl2an2r 686	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ∈ UHGraph)
10		f1of 6774	. . . . . . . . . . . . . . 15 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝐹:𝑉⟶𝑊)
11	10	3ad2ant3 1136	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) → 𝐹:𝑉⟶𝑊)
12	11	ffvelcdmda 7030	. . . . . . . . . . . . 13 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ 𝑥 ∈ 𝑉) → (𝐹‘𝑥) ∈ 𝑊)
13		oveq2 7368	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = (𝐹‘𝑥) → (𝐻 ClNeighbVtx 𝑦) = (𝐻 ClNeighbVtx (𝐹‘𝑥)))
14	13	oveq2d 7376	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (𝐹‘𝑥) → (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) = (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))
15	14	breq1d 5096	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝐹‘𝑥) → ((𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁) ↔ (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ≃𝑔𝑟 (StarGr‘𝑁)))
16	15	rspcv 3561	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑥) ∈ 𝑊 → (∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ≃𝑔𝑟 (StarGr‘𝑁)))
17	12, 16	syl 17	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ 𝑥 ∈ 𝑉) → (∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ≃𝑔𝑟 (StarGr‘𝑁)))
18	17	impancom 451	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → (𝑥 ∈ 𝑉 → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ≃𝑔𝑟 (StarGr‘𝑁)))
19	18	imp 406	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ≃𝑔𝑟 (StarGr‘𝑁))
20		gricsym 48409	. . . . . . . . . 10 ⊢ ((𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ∈ UHGraph → ((𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ≃𝑔𝑟 (StarGr‘𝑁) → (StarGr‘𝑁) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥)))))
21	9, 19, 20	sylc 65	. . . . . . . . 9 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) → (StarGr‘𝑁) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))
22	21	anim1ci 617	. . . . . . . 8 ⊢ (((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) ∧ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁)) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ (StarGr‘𝑁) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥)))))
23		grictr 48411	. . . . . . . 8 ⊢ (((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ (StarGr‘𝑁) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥)))) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))
24	22, 23	syl 17	. . . . . . 7 ⊢ (((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) ∧ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))
25	24	ex 412	. . . . . 6 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥)))))
26	25	ralimdva 3150	. . . . 5 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → (∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) → ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥)))))
27	26	ex 412	. . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) → (∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁) → (∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) → ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))))
28	27	com23 86	. . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) → (∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) → (∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁) → ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))))
29	28	3imp 1111	. 2 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))
30		clnbgr3stgrgrlim.v	. . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺)
31	30	fvexi 6848	. . . . . . 7 ⊢ 𝑉 ∈ V
32	31	a1i 11	. . . . . 6 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝑉 ∈ V)
33	10, 32	fexd 7175	. . . . 5 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝐹 ∈ V)
34	33	3anim3i 1155	. . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) → (𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹 ∈ V))
35	34	3ad2ant1 1134	. . 3 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → (𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹 ∈ V))
36	30, 5	isgrlim 48470	. . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹 ∈ V) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))))
37	35, 36	syl 17	. 2 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))))
38	1, 29, 37	mpbir2and 714	1 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → 𝐹 ∈ (𝐺 GraphLocIso 𝐻))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3052  Vcvv 3430   ⊆ wss 3890   class class class wbr 5086  ⟶wf 6488  –1-1-onto→wf1o 6491  ‘cfv 6492  (class class class)co 7360  ℕ₀cn0 12428  Vtxcvtx 29079  UHGraphcuhgr 29139  USGraphcusgr 29232   ClNeighbVtx cclnbgr 48306   ISubGr cisubgr 48348   ≃_𝑔𝑟 cgric 48364  StarGrcstgr 48439   GraphLocIso cgrlim 48464

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-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-i2m1 11097  ax-1ne0 11098  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  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-nel 3038  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-po 5532  df-so 5533  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-1o 8398  df-er 8636  df-map 8768  df-en 8887  df-dom 8888  df-sdom 8889  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-2 12235  df-vtx 29081  df-iedg 29082  df-uhgr 29141  df-upgr 29165  df-uspgr 29233  df-usgr 29234  df-clnbgr 48307  df-isubgr 48349  df-grim 48366  df-gric 48369  df-grlim 48466

This theorem is referenced by:  gpg5grlim  48581