Theorem isgrlim 49295

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

Hypotheses

Ref	Expression
isgrlim.v	⊢ 𝑉 = (Vtx‘𝐺)
isgrlim.w	⊢ 𝑊 = (Vtx‘𝐻)

Assertion

Ref	Expression
isgrlim	⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉⟶1-1onto𝑊 ∧ ∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))))))

Distinct variable groups:   𝑣,𝐹   𝑣,𝐺   𝑣,𝐻   𝑣,𝑉

Allowed substitution hints:   𝑊(𝑣)   𝑋(𝑣)   𝑌(𝑣)   𝑍(𝑣)

Proof of Theorem isgrlim

Dummy variables 𝑓 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-grlim 49291	. . 3 ⊢ GraphLocIso = (𝑔 ∈ V, ℎ ∈ V ↦ {𝑓 ∣ (𝑓:(Vtx‘𝑔)⟶1-1onto(Vtx‘ℎ) ∧ ∀𝑣 ∈ (Vtx‘𝑔)(𝑔 ISubGr (𝑔 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (ℎ ISubGr (ℎ ClNeighbVtx (𝑓‘𝑣))))})
2		elex 3475	. . . 4 ⊢ (𝐺 ∈ 𝑋 → 𝐺 ∈ V)
3	2	3ad2ant1 1151	. . 3 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → 𝐺 ∈ V)
4		elex 3475	. . . 4 ⊢ (𝐻 ∈ 𝑌 → 𝐻 ∈ V)
5	4	3ad2ant2 1152	. . 3 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → 𝐻 ∈ V)
6		f1of 6849	. . . . . 6 ⊢ (𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) → 𝑓:(Vtx‘𝐺)⟶(Vtx‘𝐻))
7	6	adantr 486	. . . . 5 ⊢ ((𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣)))) → 𝑓:(Vtx‘𝐺)⟶(Vtx‘𝐻))
8	7	adantl 487	. . . 4 ⊢ (((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) ∧ (𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣))))) → 𝑓:(Vtx‘𝐺)⟶(Vtx‘𝐻))
9		fvexd 6926	. . . 4 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (Vtx‘𝐺) ∈ V)
10		fvexd 6926	. . . 4 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (Vtx‘𝐻) ∈ V)
11	8, 9, 10	fabexd 7976	. . 3 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → {𝑓 ∣ (𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣))))} ∈ V)
12		eqidd 2764	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → 𝑓 = 𝑓)
13		fveq2 6911	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (Vtx‘𝑔) = (Vtx‘𝐺))
14	13	adantr 486	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → (Vtx‘𝑔) = (Vtx‘𝐺))
15		fveq2 6911	. . . . . . 7 ⊢ (ℎ = 𝐻 → (Vtx‘ℎ) = (Vtx‘𝐻))
16	15	adantl 487	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → (Vtx‘ℎ) = (Vtx‘𝐻))
17	12, 14, 16	f1oeq123d 6843	. . . . 5 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → (𝑓:(Vtx‘𝑔)⟶1-1onto(Vtx‘ℎ) ↔ 𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻)))
18		id 23	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → 𝑔 = 𝐺)
19		oveq1 7453	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (𝑔 ClNeighbVtx 𝑣) = (𝐺 ClNeighbVtx 𝑣))
20	18, 19	oveq12d 7464	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (𝑔 ISubGr (𝑔 ClNeighbVtx 𝑣)) = (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)))
21		id 23	. . . . . . . 8 ⊢ (ℎ = 𝐻 → ℎ = 𝐻)
22		oveq1 7453	. . . . . . . 8 ⊢ (ℎ = 𝐻 → (ℎ ClNeighbVtx (𝑓‘𝑣)) = (𝐻 ClNeighbVtx (𝑓‘𝑣)))
23	21, 22	oveq12d 7464	. . . . . . 7 ⊢ (ℎ = 𝐻 → (ℎ ISubGr (ℎ ClNeighbVtx (𝑓‘𝑣))) = (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣))))
24	20, 23	breqan12d 5122	. . . . . 6 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → ((𝑔 ISubGr (𝑔 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (ℎ ISubGr (ℎ ClNeighbVtx (𝑓‘𝑣))) ↔ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣)))))
25	14, 24	raleqbidv 3338	. . . . 5 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → (∀𝑣 ∈ (Vtx‘𝑔)(𝑔 ISubGr (𝑔 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (ℎ ISubGr (ℎ ClNeighbVtx (𝑓‘𝑣))) ↔ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣)))))
26	17, 25	anbi12d 644	. . . 4 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → ((𝑓:(Vtx‘𝑔)⟶1-1onto(Vtx‘ℎ) ∧ ∀𝑣 ∈ (Vtx‘𝑔)(𝑔 ISubGr (𝑔 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (ℎ ISubGr (ℎ ClNeighbVtx (𝑓‘𝑣)))) ↔ (𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣))))))
27	26	abbidv 2829	. . 3 ⊢ ((𝑔 = 𝐺 ∧ ℎ = 𝐻) → {𝑓 ∣ (𝑓:(Vtx‘𝑔)⟶1-1onto(Vtx‘ℎ) ∧ ∀𝑣 ∈ (Vtx‘𝑔)(𝑔 ISubGr (𝑔 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (ℎ ISubGr (ℎ ClNeighbVtx (𝑓‘𝑣))))} = {𝑓 ∣ (𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣))))})
28	1, 3, 5, 11, 27	elovmpod 7692	. 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ 𝐹 ∈ {𝑓 ∣ (𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣))))}))
29		f1oeq1 6837	. . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ↔ 𝐹:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻)))
30		fveq1 6910	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑣) = (𝐹‘𝑣))
31	30	oveq2d 7462	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝐻 ClNeighbVtx (𝑓‘𝑣)) = (𝐻 ClNeighbVtx (𝐹‘𝑣)))
32	31	oveq2d 7462	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣))) = (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))))
33	32	breq2d 5118	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣))) ↔ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣)))))
34	33	ralbidv 3189	. . . . . 6 ⊢ (𝑓 = 𝐹 → (∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣))) ↔ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣)))))
35	29, 34	anbi12d 644	. . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣)))) ↔ (𝐹:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))))))
36	35	elabg 3633	. . . 4 ⊢ (𝐹 ∈ 𝑍 → (𝐹 ∈ {𝑓 ∣ (𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣))))} ↔ (𝐹:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))))))
37	36	3ad2ant3 1153	. . 3 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ {𝑓 ∣ (𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣))))} ↔ (𝐹:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))))))
38		isgrlim.v	. . . . 5 ⊢ 𝑉 = (Vtx‘𝐺)
39		isgrlim.w	. . . . 5 ⊢ 𝑊 = (Vtx‘𝐻)
40		f1oeq23 6840	. . . . 5 ⊢ ((𝑉 = (Vtx‘𝐺) ∧ 𝑊 = (Vtx‘𝐻)) → (𝐹:𝑉⟶1-1onto𝑊 ↔ 𝐹:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻)))
41	38, 39, 40	mp2an 705	. . . 4 ⊢ (𝐹:𝑉⟶1-1onto𝑊 ↔ 𝐹:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻))
42	38	raleqi 3321	. . . 4 ⊢ (∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))))
43	41, 42	anbi12i 640	. . 3 ⊢ ((𝐹:𝑉⟶1-1onto𝑊 ∧ ∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣)))) ↔ (𝐹:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣)))))
44	37, 43	bitr4di 292	. 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ {𝑓 ∣ (𝑓:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝑓‘𝑣))))} ↔ (𝐹:𝑉⟶1-1onto𝑊 ∧ ∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))))))
45	28, 44	bitrd 282	1 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉⟶1-1onto𝑊 ∧ ∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  {cab 2741  ∀wral 3080  Vcvv 3454   class class class wbr 5106  ⟶wf 6557  ⟶1-1ontowf1o 6560  ‘cfv 6561  (class class class)co 7446  Vtxcvtx 29607   ClNeighbVtx cclnbgr 49131   ISubGr cisubgr 49173   ≃_𝑔𝑟 cgric 49189   GraphLocIso cgrlim 49289

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-grlim 49291

This theorem is used by:  isgrlim2  49296  grlimprop  49297  uhgrimgrlim  49300  dfgrlic2  49321  clnbgr3stgrgrlim  49332