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

Theorem clnbgrisubgrgrim 48424
Description: Isomorphic subgraphs induced by closed neighborhoods of vertices of two graphs. (Contributed by AV, 29-May-2025.)
Hypotheses
Ref Expression
clnbgrisubgrgrim.i 𝐼 = (iEdg‘𝐺)
clnbgrisubgrgrim.j 𝐽 = (iEdg‘𝐻)
clnbgrisubgrgrim.n 𝑁 = (𝐺 ClNeighbVtx 𝑋)
clnbgrisubgrgrim.m 𝑀 = (𝐻 ClNeighbVtx 𝑌)
clnbgrisubgrgrim.k 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼𝑥) ⊆ 𝑁}
clnbgrisubgrgrim.l 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽𝑥) ⊆ 𝑀}
Assertion
Ref Expression
clnbgrisubgrgrim ((𝐺𝑈𝐻𝑇) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑖𝐾 (𝑓 “ (𝐼𝑖)) = (𝐽‘(𝑔𝑖))))))
Distinct variable groups:   𝑓,𝐺,𝑔,𝑖   𝑥,𝐺   𝑓,𝐻,𝑔,𝑖   𝑥,𝐻   𝑥,𝐼   𝑥,𝐽   𝑓,𝑀,𝑔,𝑖   𝑥,𝑀   𝑓,𝑁,𝑔,𝑖   𝑥,𝑁   𝑇,𝑓,𝑔,𝑖   𝑈,𝑓,𝑔,𝑖   𝑖,𝐾   𝑖,𝐿
Allowed substitution hints:   𝑇(𝑥)   𝑈(𝑥)   𝐼(𝑓,𝑔,𝑖)   𝐽(𝑓,𝑔,𝑖)   𝐾(𝑥,𝑓,𝑔)   𝐿(𝑥,𝑓,𝑔)   𝑋(𝑥,𝑓,𝑔,𝑖)   𝑌(𝑥,𝑓,𝑔,𝑖)

Proof of Theorem clnbgrisubgrgrim
StepHypRef Expression
1 clnbgrisubgrgrim.n . . 3 𝑁 = (𝐺 ClNeighbVtx 𝑋)
2 eqid 2737 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
32clnbgrssvtx 48323 . . 3 (𝐺 ClNeighbVtx 𝑋) ⊆ (Vtx‘𝐺)
41, 3eqsstri 3969 . 2 𝑁 ⊆ (Vtx‘𝐺)
5 clnbgrisubgrgrim.m . . 3 𝑀 = (𝐻 ClNeighbVtx 𝑌)
6 eqid 2737 . . . 4 (Vtx‘𝐻) = (Vtx‘𝐻)
76clnbgrssvtx 48323 . . 3 (𝐻 ClNeighbVtx 𝑌) ⊆ (Vtx‘𝐻)
85, 7eqsstri 3969 . 2 𝑀 ⊆ (Vtx‘𝐻)
9 clnbgrisubgrgrim.i . . 3 𝐼 = (iEdg‘𝐺)
10 clnbgrisubgrgrim.j . . 3 𝐽 = (iEdg‘𝐻)
11 clnbgrisubgrgrim.k . . 3 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼𝑥) ⊆ 𝑁}
12 clnbgrisubgrgrim.l . . 3 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽𝑥) ⊆ 𝑀}
132, 6, 9, 10, 11, 12isubgrgrim 48421 . 2 (((𝐺𝑈𝐻𝑇) ∧ (𝑁 ⊆ (Vtx‘𝐺) ∧ 𝑀 ⊆ (Vtx‘𝐻))) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑖𝐾 (𝑓 “ (𝐼𝑖)) = (𝐽‘(𝑔𝑖))))))
144, 8, 13mpanr12 706 1 ((𝐺𝑈𝐻𝑇) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁1-1-onto𝑀 ∧ ∃𝑔(𝑔:𝐾1-1-onto𝐿 ∧ ∀𝑖𝐾 (𝑓 “ (𝐼𝑖)) = (𝐽‘(𝑔𝑖))))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wex 1781  wcel 2114  wral 3052  {crab 3390  wss 3890   class class class wbr 5086  dom cdm 5626  cima 5629  1-1-ontowf1o 6493  cfv 6494  (class class class)co 7362  Vtxcvtx 29083  iEdgciedg 29084   ClNeighbVtx cclnbgr 48310   ISubGr cisubgr 48352  𝑔𝑟 cgric 48368
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-sep 5232  ax-nul 5242  ax-pow 5304  ax-pr 5372  ax-un 7684
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-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5521  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-suc 6325  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-f1 6499  df-fo 6500  df-f1o 6501  df-fv 6502  df-ov 7365  df-oprab 7366  df-mpo 7367  df-1st 7937  df-2nd 7938  df-1o 8400  df-map 8770  df-vtx 29085  df-iedg 29086  df-clnbgr 48311  df-isubgr 48353  df-grim 48370  df-gric 48373
This theorem is referenced by:  isgrlim2  48475
  Copyright terms: Public domain W3C validator