Theorem clnbgrisubgrgrim 49245

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-1onto𝑀 ∧ ∃𝑔(𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))

Distinct variable groups:   𝑓,𝐺,𝑔,𝑖   𝑥,𝐺   𝑓,𝐻,𝑔,𝑖   𝑥,𝐻   𝑥,𝐼   𝑥,𝐽   𝑓,𝑀,𝑔,𝑖   𝑥,𝑀   𝑓,𝑁,𝑔,𝑖   𝑥,𝑁   𝑇,𝑓,𝑔,𝑖   𝑈,𝑓,𝑔,𝑖   𝑖,𝐾   𝑖,𝐿

Allowed substitution hints:   𝑇(𝑥)   𝑈(𝑥)   𝐼(𝑓, 𝑔, 𝑖)   𝐽(𝑓, 𝑔, 𝑖)   𝐾(𝑥, 𝑓, 𝑔)   𝐿(𝑥, 𝑓, 𝑔)   𝑋(𝑥, 𝑓, 𝑔, 𝑖)   𝑌(𝑥, 𝑓, 𝑔, 𝑖)

Proof of Theorem clnbgrisubgrgrim

Step	Hyp	Ref	Expression
1		clnbgrisubgrgrim.n	. . 3 ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑋)
2		eqid 2763	. . . 4 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
3	2	clnbgrssvtx 49144	. . 3 ⊢ (𝐺 ClNeighbVtx 𝑋) ⊆ (Vtx‘𝐺)
4	1, 3	eqsstri 3959	. 2 ⊢ 𝑁 ⊆ (Vtx‘𝐺)
5		clnbgrisubgrgrim.m	. . 3 ⊢ 𝑀 = (𝐻 ClNeighbVtx 𝑌)
6		eqid 2763	. . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻)
7	6	clnbgrssvtx 49144	. . 3 ⊢ (𝐻 ClNeighbVtx 𝑌) ⊆ (Vtx‘𝐻)
8	5, 7	eqsstri 3959	. 2 ⊢ 𝑀 ⊆ (Vtx‘𝐻)
9		clnbgrisubgrgrim.i	. . 3 ⊢ 𝐼 = (iEdg‘𝐺)
10		clnbgrisubgrgrim.j	. . 3 ⊢ 𝐽 = (iEdg‘𝐻)
11		clnbgrisubgrgrim.k	. . 3 ⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
12		clnbgrisubgrgrim.l	. . 3 ⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}
13	2, 6, 9, 10, 11, 12	isubgrgrim 49242	. 2 ⊢ (((𝐺 ∈ 𝑈 ∧ 𝐻 ∈ 𝑇) ∧ (𝑁 ⊆ (Vtx‘𝐺) ∧ 𝑀 ⊆ (Vtx‘𝐻))) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁⟶1-1onto𝑀 ∧ ∃𝑔(𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
14	4, 8, 13	mpanr12 718	1 ⊢ ((𝐺 ∈ 𝑈 ∧ 𝐻 ∈ 𝑇) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁⟶1-1onto𝑀 ∧ ∃𝑔(𝑔:𝐾⟶1-1onto𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∀wral 3080  {crab 3416   ⊆ wss 3900   class class class wbr 5106  dom cdm 5656   “ cima 5659  ⟶1-1ontowf1o 6560  ‘cfv 6561  (class class class)co 7446  Vtxcvtx 29607  iEdgciedg 29608   ClNeighbVtx cclnbgr 49131   ISubGr cisubgr 49173   ≃_𝑔𝑟 cgric 49189

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-1st 8028  df-2nd 8029  df-1o 8507  df-map 8880  df-vtx 29609  df-iedg 29610  df-clnbgr 49132  df-isubgr 49174  df-grim 49191  df-gric 49194

This theorem is used by:  isgrlim2  49296