Theorem grlimprop2 48484

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 48478	. . . . 5 ⊢ Rel dom GraphLocIso
2	1	ovrcl 7404	. . . 4 ⊢ (𝐹 ∈ (𝐺 GraphLocIso 𝐻) → (𝐺 ∈ V ∧ 𝐻 ∈ V))
3		id 22	. . . 4 ⊢ (𝐹 ∈ (𝐺 GraphLocIso 𝐻) → 𝐹 ∈ (𝐺 GraphLocIso 𝐻))
4		df-3an 1094	. . . 4 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V ∧ 𝐹 ∈ (𝐺 GraphLocIso 𝐻)) ↔ ((𝐺 ∈ V ∧ 𝐻 ∈ V) ∧ 𝐹 ∈ (𝐺 GraphLocIso 𝐻)))
5	2, 3, 4	sylanbrc 589	. . 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 48481	. . 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 268	1 ⊢ (𝐹 ∈ (𝐺 GraphLocIso 𝐻) → (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   ∧ w3a 1092   = wceq 1547  ∃wex 1786   ∈ wcel 2119  ∀wral 3054  {crab 3392  Vcvv 3432   ⊆ wss 3890  dom cdm 5625   “ cima 5628  –1-1-onto→wf1o 6491  ‘cfv 6492  (class class class)co 7363  Vtxcvtx 29090  iEdgciedg 29091   ClNeighbVtx cclnbgr 48316   GraphLocIso cgrlim 48474

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7366  df-oprab 7367  df-mpo 7368  df-1st 7938  df-2nd 7939  df-1o 8402  df-map 8772  df-vtx 29092  df-iedg 29093  df-clnbgr 48317  df-isubgr 48359  df-grim 48376  df-gric 48379  df-grlim 48476

This theorem is referenced by: (None)