Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  uhgrimgrlim Structured version   Visualization version   GIF version

Theorem uhgrimgrlim 47954
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.
StepHypRef Expression
1 eqid 2737 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
2 eqid 2737 . . . 4 (Vtx‘𝐻) = (Vtx‘𝐻)
31, 2grimf1o 47870 . . 3 (𝐹 ∈ (𝐺 GraphIso 𝐻) → 𝐹:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻))
433ad2ant3 1136 . 2 ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → 𝐹:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻))
5 simpl1 1192 . . . . 5 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → 𝐺 ∈ UHGraph)
6 simpl3 1194 . . . . 5 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → 𝐹 ∈ (𝐺 GraphIso 𝐻))
71clnbgrssvtx 47818 . . . . . 6 (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺)
87a1i 11 . . . . 5 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺))
91uhgrimisgrgric 47899 . . . . 5 ((𝐺 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻) ∧ (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐹 “ (𝐺 ClNeighbVtx 𝑣))))
105, 6, 8, 9syl3anc 1373 . . . 4 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐹 “ (𝐺 ClNeighbVtx 𝑣))))
11 df-3an 1089 . . . . . 6 ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ↔ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph) ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)))
121clnbgrgrim 47902 . . . . . 6 ((((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph) ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐻 ClNeighbVtx (𝐹𝑣)) = (𝐹 “ (𝐺 ClNeighbVtx 𝑣)))
1311, 12sylanb 581 . . . . 5 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐻 ClNeighbVtx (𝐹𝑣)) = (𝐹 “ (𝐺 ClNeighbVtx 𝑣)))
1413oveq2d 7447 . . . 4 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹𝑣))) = (𝐻 ISubGr (𝐹 “ (𝐺 ClNeighbVtx 𝑣))))
1510, 14breqtrrd 5171 . . 3 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹𝑣))))
1615ralrimiva 3146 . 2 ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹𝑣))))
171, 2isgrlim 47949 . 2 ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹𝑣))))))
184, 16, 17mpbir2and 713 1 ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → 𝐹 ∈ (𝐺 GraphLocIso 𝐻))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1540  wcel 2108  wral 3061  wss 3951   class class class wbr 5143  cima 5688  1-1-ontowf1o 6560  cfv 6561  (class class class)co 7431  Vtxcvtx 29013  UHGraphcuhgr 29073   ClNeighbVtx cclnbgr 47805   ISubGr cisubgr 47846   GraphIso cgrim 47861  𝑔𝑟 cgric 47862   GraphLocIso cgrlim 47943
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8014  df-2nd 8015  df-1o 8506  df-map 8868  df-vtx 29015  df-iedg 29016  df-edg 29065  df-uhgr 29075  df-clnbgr 47806  df-isubgr 47847  df-grim 47864  df-gric 47867  df-grlim 47945
This theorem is referenced by:  gricgrlic  47978
  Copyright terms: Public domain W3C validator