| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > isgrlim2 | Structured version Visualization version GIF version | ||
| Description: A local isomorphism of graphs is a bijection between their vertices that preserves neighborhoods. Definitions expanded. (Contributed by AV, 29-May-2025.) |
| Ref | Expression |
|---|---|
| isgrlim.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| isgrlim.w | ⊢ 𝑊 = (Vtx‘𝐻) |
| isgrlim2.n | ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑣) |
| isgrlim2.m | ⊢ 𝑀 = (𝐻 ClNeighbVtx (𝐹‘𝑣)) |
| isgrlim2.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| isgrlim2.j | ⊢ 𝐽 = (iEdg‘𝐻) |
| isgrlim2.k | ⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁} |
| isgrlim2.l | ⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀} |
| Ref | Expression |
|---|---|
| isgrlim2 | ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isgrlim.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | isgrlim.w | . . 3 ⊢ 𝑊 = (Vtx‘𝐻) | |
| 3 | 1, 2 | isgrlim 48568 | . 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣)))))) |
| 4 | isgrlim2.n | . . . . . . . . 9 ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑣) | |
| 5 | 4 | eqcomi 2770 | . . . . . . . 8 ⊢ (𝐺 ClNeighbVtx 𝑣) = 𝑁 |
| 6 | 5 | oveq2i 7403 | . . . . . . 7 ⊢ (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) = (𝐺 ISubGr 𝑁) |
| 7 | isgrlim2.m | . . . . . . . . 9 ⊢ 𝑀 = (𝐻 ClNeighbVtx (𝐹‘𝑣)) | |
| 8 | 7 | eqcomi 2770 | . . . . . . . 8 ⊢ (𝐻 ClNeighbVtx (𝐹‘𝑣)) = 𝑀 |
| 9 | 8 | oveq2i 7403 | . . . . . . 7 ⊢ (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) = (𝐻 ISubGr 𝑀) |
| 10 | 6, 9 | breq12i 5108 | . . . . . 6 ⊢ ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ (𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀)) |
| 11 | 10 | a1i 11 | . . . . 5 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ (𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀))) |
| 12 | isgrlim2.i | . . . . . . 7 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 13 | isgrlim2.j | . . . . . . 7 ⊢ 𝐽 = (iEdg‘𝐻) | |
| 14 | isgrlim2.k | . . . . . . 7 ⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁} | |
| 15 | isgrlim2.l | . . . . . . 7 ⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀} | |
| 16 | 12, 13, 4, 7, 14, 15 | clnbgrisubgrgrim 48518 | . . . . . 6 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 17 | 16 | 3adant3 1144 | . . . . 5 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐺 ISubGr 𝑁) ≃𝑔𝑟 (𝐻 ISubGr 𝑀) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 18 | 11, 17 | bitrd 281 | . . . 4 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 19 | 18 | ralbidv 3184 | . . 3 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣))) ↔ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))) |
| 20 | 19 | anbi2d 639 | . 2 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → ((𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 (𝐺 ISubGr (𝐺 ClNeighbVtx 𝑣)) ≃𝑔𝑟 (𝐻 ISubGr (𝐻 ClNeighbVtx (𝐹‘𝑣)))) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))) |
| 21 | 3, 20 | bitrd 281 | 1 ⊢ ((𝐺 ∈ 𝑋 ∧ 𝐻 ∈ 𝑌 ∧ 𝐹 ∈ 𝑍) → (𝐹 ∈ (𝐺 GraphLocIso 𝐻) ↔ (𝐹:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑓(𝑓:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑓 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∃wex 1798 ∈ wcel 2141 ∀wral 3075 {crab 3413 ⊆ wss 3904 class class class wbr 5099 dom cdm 5645 “ cima 5648 –1-1-onto→wf1o 6516 ‘cfv 6517 (class class class)co 7392 Vtxcvtx 29143 iEdgciedg 29144 ClNeighbVtx cclnbgr 48404 ISubGr cisubgr 48446 ≃𝑔𝑟 cgric 48462 GraphLocIso cgrlim 48562 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-ov 7395 df-oprab 7396 df-mpo 7397 df-1st 7966 df-2nd 7967 df-1o 8432 df-map 8805 df-vtx 29145 df-iedg 29146 df-clnbgr 48405 df-isubgr 48447 df-grim 48464 df-gric 48467 df-grlim 48564 |
| This theorem is referenced by: grlimprop2 48572 uspgrlim 48578 dfgrlic3 48596 |
| Copyright terms: Public domain | W3C validator |