Theorem clnbgr3stgrgrlim 48639

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 1222	. 2 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → 𝐹:𝑉–1-1-onto→𝑊)
2		usgruhgr 29445	. . . . . . . . . . . . 13 ⊢ (𝐻 ∈ USGraph → 𝐻 ∈ UHGraph)
3	2	3ad2ant2 1150	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) → 𝐻 ∈ UHGraph)
4	3	adantr 485	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → 𝐻 ∈ UHGraph)
5		clnbgr3stgrgrlim.w	. . . . . . . . . . . . 13 ⊢ 𝑊 = (Vtx‘𝐻)
6	5	clnbgrssvtx 48451	. . . . . . . . . . . 12 ⊢ (𝐻 ClNeighbVtx (𝐹‘𝑥)) ⊆ 𝑊
7	6	a1i 11	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) → (𝐻 ClNeighbVtx (𝐹‘𝑥)) ⊆ 𝑊)
8	5	isubgruhgr 48488	. . . . . . . . . . 11 ⊢ ((𝐻 ∈ UHGraph ∧ (𝐻 ClNeighbVtx (𝐹‘𝑥)) ⊆ 𝑊) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ∈ UHGraph)
9	4, 7, 8	syl2an2r 697	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ∈ UHGraph)
10		f1of 6810	. . . . . . . . . . . . . . 15 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝐹:𝑉⟶𝑊)
11	10	3ad2ant3 1151	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) → 𝐹:𝑉⟶𝑊)
12	11	ffvelcdmda 7069	. . . . . . . . . . . . 13 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ 𝑥 ∈ 𝑉) → (𝐹‘𝑥) ∈ 𝑊)
13		oveq2 7408	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = (𝐹‘𝑥) → (𝐻 ClNeighbVtx 𝑦) = (𝐻 ClNeighbVtx (𝐹‘𝑥)))
14	13	oveq2d 7416	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (𝐹‘𝑥) → (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) = (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))
15	14	breq1d 5115	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝐹‘𝑥) → ((𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁) ↔ (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ≃𝑔𝑟 (StarGr‘𝑁)))
16	15	rspcv 3580	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑥) ∈ 𝑊 → (∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ≃𝑔𝑟 (StarGr‘𝑁)))
17	12, 16	syl 18	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ 𝑥 ∈ 𝑉) → (∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ≃𝑔𝑟 (StarGr‘𝑁)))
18	17	impancom 456	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → (𝑥 ∈ 𝑉 → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ≃𝑔𝑟 (StarGr‘𝑁)))
19	18	imp 411	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ≃𝑔𝑟 (StarGr‘𝑁))
20		gricsym 48541	. . . . . . . . . 10 ⊢ ((𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ∈ UHGraph → ((𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))) ≃𝑔𝑟 (StarGr‘𝑁) → (StarGr‘𝑁) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥)))))
21	9, 19, 20	sylc 66	. . . . . . . . 9 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) → (StarGr‘𝑁) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))
22	21	anim1ci 627	. . . . . . . 8 ⊢ (((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) ∧ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁)) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ (StarGr‘𝑁) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥)))))
23		grictr 48543	. . . . . . . 8 ⊢ (((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ (StarGr‘𝑁) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥)))) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))
24	22, 23	syl 18	. . . . . . 7 ⊢ (((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) ∧ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))
25	24	ex 417	. . . . . 6 ⊢ ((((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) ∧ 𝑥 ∈ 𝑉) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥)))))
26	25	ralimdva 3177	. . . . 5 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → (∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) → ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥)))))
27	26	ex 417	. . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) → (∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁) → (∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) → ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))))
28	27	com23 87	. . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) → (∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) → (∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁) → ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))))
29	28	3imp 1126	. 2 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))
30		clnbgr3stgrgrlim.v	. . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺)
31	30	fvexi 6885	. . . . . . 7 ⊢ 𝑉 ∈ V
32	31	a1i 11	. . . . . 6 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝑉 ∈ V)
33	10, 32	fexd 7215	. . . . 5 ⊢ (𝐹:𝑉–1-1-onto→𝑊 → 𝐹 ∈ V)
34	33	3anim3i 1170	. . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) → (𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹 ∈ V))
35	34	3ad2ant1 1149	. . 3 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → (𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹 ∈ V))
36	30, 5	isgrlim 48602	. . 3 ⊢ ((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹 ∈ V) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑥))))))
37	35, 36	syl 18	. 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 725	1 ⊢ (((𝐺 ∈ USGraph ∧ 𝐻 ∈ USGraph ∧ 𝐹:𝑉–1-1-onto→𝑊) ∧ ∀𝑥 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑥)) ≃𝑔𝑟 (StarGr‘𝑁) ∧ ∀𝑦 ∈ 𝑊 (𝐻 ISubGr (𝐻 ClNeighbVtx 𝑦)) ≃𝑔𝑟 (StarGr‘𝑁)) → 𝐹 ∈ (𝐺 GraphLocIso 𝐻))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1563   ∈ wcel 2145  ∀wral 3079  Vcvv 3457   ⊆ wss 3907   class class class wbr 5105  ⟶wf 6521  –1-1-onto→wf1o 6524  ‘cfv 6525  (class class class)co 7400  ℕ₀cn0 12495  Vtxcvtx 29255  UHGraphcuhgr 29315  USGraphcusgr 29408   ClNeighbVtx cclnbgr 48438   ISubGr cisubgr 48480   ≃_𝑔𝑟 cgric 48496  StarGrcstgr 48571   GraphLocIso cgrlim 48596

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-resscn 11145  ax-1cn 11146  ax-icn 11147  ax-addcl 11148  ax-addrcl 11149  ax-mulcl 11150  ax-mulrcl 11151  ax-i2m1 11156  ax-1ne0 11157  ax-rrecex 11160  ax-cnre 11161  ax-pre-lttri 11162  ax-pre-lttrn 11163

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-po 5560  df-so 5561  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-ov 7403  df-oprab 7404  df-mpo 7405  df-1st 7974  df-2nd 7975  df-1o 8441  df-er 8682  df-map 8814  df-en 8932  df-dom 8933  df-sdom 8934  df-pnf 11233  df-mnf 11234  df-xr 11235  df-ltxr 11236  df-le 11237  df-2 12294  df-vtx 29257  df-iedg 29258  df-uhgr 29317  df-upgr 29341  df-uspgr 29409  df-usgr 29410  df-clnbgr 48439  df-isubgr 48481  df-grim 48498  df-gric 48501  df-grlim 48598

This theorem is referenced by:  gpg5grlim  48713