Theorem grlimprop2 48340

Description: Properties of a local isomorphism of graphs. (Contributed by AV, 29-May-2025.)

Hypotheses

Ref	Expression
grlimprop.v	⊢ 𝑉 = (Vtx‘𝐺)
grlimprop.w	⊢ 𝑊 = (Vtx‘𝐻)
grlimprop2.n	⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑣)
grlimprop2.m	⊢ 𝑀 = (𝐻 ClNeighbVtx (𝐹‘𝑣))
grlimprop2.i	⊢ 𝐼 = (iEdg‘𝐺)
grlimprop2.j	⊢ 𝐽 = (iEdg‘𝐻)
grlimprop2.k	⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
grlimprop2.l	⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}

Assertion

Ref	Expression
grlimprop2	⊢ (𝐹 ∈ (𝐺 GraphLocIso 𝐻) → (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))

Distinct variable groups:   𝑣,𝐹   𝑣,𝐺   𝑣,𝐻   𝑣,𝑉   𝑓,𝐹,𝑔,𝑣   𝑓,𝐺,𝑔,𝑖,𝑥   𝑓,𝐻,𝑔,𝑖,𝑥   𝑥,𝐼   𝑥,𝐽   𝑖,𝐾   𝑖,𝐿   𝑓,𝑀,𝑔,𝑖,𝑥   𝑓,𝑁,𝑔,𝑖,𝑥   𝑣,𝑖

Allowed substitution hints:   𝐹(𝑥,𝑖)   𝐼(𝑣,𝑓,𝑔,𝑖)   𝐽(𝑣,𝑓,𝑔,𝑖)   𝐾(𝑥,𝑣,𝑓,𝑔)   𝐿(𝑥,𝑣,𝑓,𝑔)   𝑀(𝑣)   𝑁(𝑣)   𝑉(𝑥,𝑓,𝑔,𝑖)   𝑊(𝑥,𝑣,𝑓,𝑔,𝑖)

Proof of Theorem grlimprop2

Step	Hyp	Ref	Expression
1		grlimdmrel 48334	. . . . 5 ⊢ Rel dom GraphLocIso
2	1	ovrcl 7409	. . . 4 ⊢ (𝐹 ∈ (𝐺 GraphLocIso 𝐻) → (𝐺 ∈ V ∧ 𝐻 ∈ V))
3		id 22	. . . 4 ⊢ (𝐹 ∈ (𝐺 GraphLocIso 𝐻) → 𝐹 ∈ (𝐺 GraphLocIso 𝐻))
4		df-3an 1089	. . . 4 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V ∧ 𝐹 ∈ (𝐺 GraphLocIso 𝐻)) ↔ ((𝐺 ∈ V ∧ 𝐻 ∈ V) ∧ 𝐹 ∈ (𝐺 GraphLocIso 𝐻)))
5	2, 3, 4	sylanbrc 584	. . 3 ⊢ (𝐹 ∈ (𝐺 GraphLocIso 𝐻) → (𝐺 ∈ V ∧ 𝐻 ∈ V ∧ 𝐹 ∈ (𝐺 GraphLocIso 𝐻)))
6		grlimprop.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
7		grlimprop.w	. . . 4 ⊢ 𝑊 = (Vtx‘𝐻)
8		grlimprop2.n	. . . 4 ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑣)
9		grlimprop2.m	. . . 4 ⊢ 𝑀 = (𝐻 ClNeighbVtx (𝐹‘𝑣))
10		grlimprop2.i	. . . 4 ⊢ 𝐼 = (iEdg‘𝐺)
11		grlimprop2.j	. . . 4 ⊢ 𝐽 = (iEdg‘𝐻)
12		grlimprop2.k	. . . 4 ⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
13		grlimprop2.l	. . . 4 ⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}
14	6, 7, 8, 9, 10, 11, 12, 13	isgrlim2 48337	. . 3 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V ∧ 𝐹 ∈ (𝐺 GraphLocIso 𝐻)) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))
15	5, 14	syl 17	. 2 ⊢ (𝐹 ∈ (𝐺 GraphLocIso 𝐻) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))
16	15	ibi 267	1 ⊢ (𝐹 ∈ (𝐺 GraphLocIso 𝐻) → (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114  ∀wral 3052  {crab 3401  Vcvv 3442   ⊆ wss 3903  dom cdm 5632   “ cima 5635  –1-1-onto→wf1o 6499  ‘cfv 6500  (class class class)co 7368  Vtxcvtx 29081  iEdgciedg 29082   ClNeighbVtx cclnbgr 48172   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-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-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-clnbgr 48173  df-isubgr 48215  df-grim 48232  df-gric 48235  df-grlim 48332

This theorem is referenced by: (None)