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 48341
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 48238 . . 3 (𝐹 ∈ (𝐺 GraphIso 𝐻) → 𝐹:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻))
433ad2ant3 1136 . 2 ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → 𝐹:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻))
5 simpl1 1193 . . . . 5 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → 𝐺 ∈ UHGraph)
6 simpl3 1195 . . . . 5 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → 𝐹 ∈ (𝐺 GraphIso 𝐻))
71clnbgrssvtx 48185 . . . . . 6 (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺)
87a1i 11 . . . . 5 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺))
91uhgrimisgrgric 48285 . . . . 5 ((𝐺 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻) ∧ (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐹 “ (𝐺 ClNeighbVtx 𝑣))))
105, 6, 8, 9syl3anc 1374 . . . 4 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐹 “ (𝐺 ClNeighbVtx 𝑣))))
11 df-3an 1089 . . . . . 6 ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ↔ ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph) ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)))
121clnbgrgrim 48288 . . . . . 6 ((((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph) ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐻 ClNeighbVtx (𝐹𝑣)) = (𝐹 “ (𝐺 ClNeighbVtx 𝑣)))
1311, 12sylanb 582 . . . . 5 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐻 ClNeighbVtx (𝐹𝑣)) = (𝐹 “ (𝐺 ClNeighbVtx 𝑣)))
1413oveq2d 7384 . . . 4 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹𝑣))) = (𝐻 ISubGr (𝐹 “ (𝐺 ClNeighbVtx 𝑣))))
1510, 14breqtrrd 5128 . . 3 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹𝑣))))
1615ralrimiva 3130 . 2 ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹𝑣))))
171, 2isgrlim 48336 . 2 ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:(Vtx‘𝐺)–1-1-onto→(Vtx‘𝐻) ∧ ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹𝑣))))))
184, 16, 17mpbir2and 714 1 ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → 𝐹 ∈ (𝐺 GraphLocIso 𝐻))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052  wss 3903   class class class wbr 5100  cima 5635  1-1-ontowf1o 6499  cfv 6500  (class class class)co 7368  Vtxcvtx 29081  UHGraphcuhgr 29141   ClNeighbVtx cclnbgr 48172   ISubGr cisubgr 48214   GraphIso cgrim 48229  𝑔𝑟 cgric 48230   GraphLocIso cgrlim 48330
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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  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-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-1o 8407  df-map 8777  df-vtx 29083  df-iedg 29084  df-edg 29133  df-uhgr 29143  df-clnbgr 48173  df-isubgr 48215  df-grim 48232  df-gric 48235  df-grlim 48332
This theorem is referenced by:  gricgrlic  48372
  Copyright terms: Public domain W3C validator