Theorem uhgrimgrlim 48608

Description: An isomorphism of hypergraphs is a local isomorphism between the two graphs. (Contributed by AV, 2-Jun-2025.)

Assertion

Ref	Expression
uhgrimgrlim	⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → 𝐹 ∈ (𝐺 GraphLocIso 𝐻))

Proof of Theorem uhgrimgrlim

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2765	. . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
2		eqid 2765	. . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻)
3	1, 2	grimf1o 48505	. . 3 ⊢ (𝐹 ∈ (𝐺 GraphIso 𝐻) → 𝐹:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻))
4	3	3ad2ant3 1151	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → 𝐹:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻))
5		simpl1 1208	. . . . 5 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → 𝐺 ∈ UHGraph)
6		simpl3 1210	. . . . 5 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → 𝐹 ∈ (𝐺 GraphIso 𝐻))
7	1	clnbgrssvtx 48452	. . . . . 6 ⊢ (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺)
8	7	a1i 11	. . . . 5 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺))
9	1	uhgrimisgrgric 48552	. . . . 5 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻) ∧ (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐹 “ (𝐺 ClNeighbVtx 𝑣))))
10	5, 6, 8, 9	syl3anc 1394	. . . 4 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐹 “ (𝐺 ClNeighbVtx 𝑣))))
11		df-3an 1103	. . . . . 6 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ↔ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph) ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)))
12	1	clnbgrgrim 48555	. . . . . 6 ⊢ ((((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph) ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐻 ClNeighbVtx (𝐹‘𝑣)) = (𝐹 “ (𝐺 ClNeighbVtx 𝑣)))
13	11, 12	sylanb 592	. . . . 5 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐻 ClNeighbVtx (𝐹‘𝑣)) = (𝐹 “ (𝐺 ClNeighbVtx 𝑣)))
14	13	oveq2d 7416	. . . 4 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) = (𝐻 ISubGr (𝐹 “ (𝐺 ClNeighbVtx 𝑣))))
15	10, 14	breqtrrd 5132	. . 3 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))))
16	15	ralrimiva 3157	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))))
17	1, 2	isgrlim 48603	. 2 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))))))
18	4, 16, 17	mpbir2and 725	1 ⊢ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → 𝐹 ∈ (𝐺 GraphLocIso 𝐻))

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1101   = wceq 1563   ∈ wcel 2145  ∀wral 3079   ⊆ wss 3907   class class class wbr 5104   “ cima 5654  –1-1-onto→wf1o 6524  ‘cfv 6525  (class class class)co 7400  Vtxcvtx 29251  UHGraphcuhgr 29311   ClNeighbVtx cclnbgr 48439   ISubGr cisubgr 48481   GraphIso cgrim 48496   ≃_𝑔𝑟 cgric 48497   GraphLocIso cgrlim 48597

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 5231  ax-sep 5250  ax-nul 5260  ax-pow 5326  ax-pr 5394  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  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-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 4868  df-iun 4953  df-br 5105  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-suc 6355  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-map 8814  df-vtx 29253  df-iedg 29254  df-edg 29303  df-uhgr 29313  df-clnbgr 48440  df-isubgr 48482  df-grim 48499  df-gric 48502  df-grlim 48599

This theorem is referenced by:  gricgrlic  48639