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 48463
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 2736 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
2 eqid 2736 . . . 4 (Vtx‘𝐻) = (Vtx‘𝐻)
31, 2grimf1o 48360 . . 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 48307 . . . . . 6 (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺)
87a1i 11 . . . . 5 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ClNeighbVtx 𝑣) ⊆ (Vtx‘𝐺))
91uhgrimisgrgric 48407 . . . . 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 48410 . . . . . 6 ((((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph) ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐻 ClNeighbVtx (𝐹𝑣)) = (𝐹 “ (𝐺 ClNeighbVtx 𝑣)))
1311, 12sylanb 582 . . . . 5 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐻 ClNeighbVtx (𝐹𝑣)) = (𝐹 “ (𝐺 ClNeighbVtx 𝑣)))
1413oveq2d 7383 . . . 4 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹𝑣))) = (𝐻 ISubGr (𝐹 “ (𝐺 ClNeighbVtx 𝑣))))
1510, 14breqtrrd 5113 . . 3 (((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) ∧ 𝑣 ∈ (Vtx‘𝐺)) → (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹𝑣))))
1615ralrimiva 3129 . 2 ((𝐺 ∈ UHGraph ∧ 𝐻 ∈ UHGraph ∧ 𝐹 ∈ (𝐺 GraphIso 𝐻)) → ∀𝑣 ∈ (Vtx‘𝐺)(𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹𝑣))))
171, 2isgrlim 48458 . 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 3051  wss 3889   class class class wbr 5085  cima 5634  1-1-ontowf1o 6497  cfv 6498  (class class class)co 7367  Vtxcvtx 29065  UHGraphcuhgr 29125   ClNeighbVtx cclnbgr 48294   ISubGr cisubgr 48336   GraphIso cgrim 48351  𝑔𝑟 cgric 48352   GraphLocIso cgrlim 48452
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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-1o 8405  df-map 8775  df-vtx 29067  df-iedg 29068  df-edg 29117  df-uhgr 29127  df-clnbgr 48295  df-isubgr 48337  df-grim 48354  df-gric 48357  df-grlim 48454
This theorem is referenced by:  gricgrlic  48494
  Copyright terms: Public domain W3C validator