| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > upgrimcycls | Structured version Visualization version GIF version | ||
| Description: Graph isomorphisms between simple pseudographs map cycles onto cycles. (Contributed by AV, 31-Oct-2025.) |
| Ref | Expression |
|---|---|
| upgrimwlk.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| upgrimwlk.j | ⊢ 𝐽 = (iEdg‘𝐻) |
| upgrimwlk.g | ⊢ (𝜑 → 𝐺 ∈ USPGraph) |
| upgrimwlk.h | ⊢ (𝜑 → 𝐻 ∈ USPGraph) |
| upgrimwlk.n | ⊢ (𝜑 → 𝑁 ∈ (𝐺 GraphIso 𝐻)) |
| upgrimwlk.e | ⊢ 𝐸 = (𝑥 ∈ dom 𝐹 ↦ (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥))))) |
| upgrimcycls.c | ⊢ (𝜑 → 𝐹(Cycles‘𝐺)𝑃) |
| Ref | Expression |
|---|---|
| upgrimcycls | ⊢ (𝜑 → 𝐸(Cycles‘𝐻)(𝑁 ∘ 𝑃)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | upgrimwlk.i | . . 3 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 2 | upgrimwlk.j | . . 3 ⊢ 𝐽 = (iEdg‘𝐻) | |
| 3 | upgrimwlk.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ USPGraph) | |
| 4 | upgrimwlk.h | . . 3 ⊢ (𝜑 → 𝐻 ∈ USPGraph) | |
| 5 | upgrimwlk.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ (𝐺 GraphIso 𝐻)) | |
| 6 | upgrimwlk.e | . . 3 ⊢ 𝐸 = (𝑥 ∈ dom 𝐹 ↦ (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥))))) | |
| 7 | upgrimcycls.c | . . . 4 ⊢ (𝜑 → 𝐹(Cycles‘𝐺)𝑃) | |
| 8 | cyclispth 30443 | . . . 4 ⊢ (𝐹(Cycles‘𝐺)𝑃 → 𝐹(Paths‘𝐺)𝑃) | |
| 9 | 7, 8 | syl 18 | . . 3 ⊢ (𝜑 → 𝐹(Paths‘𝐺)𝑃) |
| 10 | 1, 2, 3, 4, 5, 6, 9 | upgrimpths 49340 | . 2 ⊢ (𝜑 → 𝐸(Paths‘𝐻)(𝑁 ∘ 𝑃)) |
| 11 | iscycl 30437 | . . . . . 6 ⊢ (𝐹(Cycles‘𝐺)𝑃 ↔ (𝐹(Paths‘𝐺)𝑃 ∧ (𝑃‘0) = (𝑃‘(♯‘𝐹)))) | |
| 12 | 11 | simprbi 503 | . . . . 5 ⊢ (𝐹(Cycles‘𝐺)𝑃 → (𝑃‘0) = (𝑃‘(♯‘𝐹))) |
| 13 | 7, 12 | syl 18 | . . . 4 ⊢ (𝜑 → (𝑃‘0) = (𝑃‘(♯‘𝐹))) |
| 14 | 13 | fveq2d 6919 | . . 3 ⊢ (𝜑 → (𝑁‘(𝑃‘0)) = (𝑁‘(𝑃‘(♯‘𝐹)))) |
| 15 | cycliswlk 30445 | . . . . 5 ⊢ (𝐹(Cycles‘𝐺)𝑃 → 𝐹(Walks‘𝐺)𝑃) | |
| 16 | eqid 2766 | . . . . . 6 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 17 | 16 | wlkp 30256 | . . . . 5 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺)) |
| 18 | 7, 15, 17 | 3syl 19 | . . . 4 ⊢ (𝜑 → 𝑃:(0...(♯‘𝐹))⟶(Vtx‘𝐺)) |
| 19 | wlkcl 30255 | . . . . . 6 ⊢ (𝐹(Walks‘𝐺)𝑃 → (♯‘𝐹) ∈ ℕ0) | |
| 20 | 7, 15, 19 | 3syl 19 | . . . . 5 ⊢ (𝜑 → (♯‘𝐹) ∈ ℕ0) |
| 21 | 0elfz 13797 | . . . . 5 ⊢ ((♯‘𝐹) ∈ ℕ0 → 0 ∈ (0...(♯‘𝐹))) | |
| 22 | 20, 21 | syl 18 | . . . 4 ⊢ (𝜑 → 0 ∈ (0...(♯‘𝐹))) |
| 23 | 18, 22 | fvco3d 7016 | . . 3 ⊢ (𝜑 → ((𝑁 ∘ 𝑃)‘0) = (𝑁‘(𝑃‘0))) |
| 24 | 1 | wlkf 30254 | . . . . . . 7 ⊢ (𝐹(Walks‘𝐺)𝑃 → 𝐹 ∈ Word dom 𝐼) |
| 25 | 7, 15, 24 | 3syl 19 | . . . . . 6 ⊢ (𝜑 → 𝐹 ∈ Word dom 𝐼) |
| 26 | 1, 2, 3, 4, 5, 6, 25 | upgrimwlklem1 49328 | . . . . 5 ⊢ (𝜑 → (♯‘𝐸) = (♯‘𝐹)) |
| 27 | 26 | fveq2d 6919 | . . . 4 ⊢ (𝜑 → ((𝑁 ∘ 𝑃)‘(♯‘𝐸)) = ((𝑁 ∘ 𝑃)‘(♯‘𝐹))) |
| 28 | nn0fz0 13798 | . . . . . 6 ⊢ ((♯‘𝐹) ∈ ℕ0 ↔ (♯‘𝐹) ∈ (0...(♯‘𝐹))) | |
| 29 | 20, 28 | sylib 221 | . . . . 5 ⊢ (𝜑 → (♯‘𝐹) ∈ (0...(♯‘𝐹))) |
| 30 | 18, 29 | fvco3d 7016 | . . . 4 ⊢ (𝜑 → ((𝑁 ∘ 𝑃)‘(♯‘𝐹)) = (𝑁‘(𝑃‘(♯‘𝐹)))) |
| 31 | 27, 30 | eqtrd 2801 | . . 3 ⊢ (𝜑 → ((𝑁 ∘ 𝑃)‘(♯‘𝐸)) = (𝑁‘(𝑃‘(♯‘𝐹)))) |
| 32 | 14, 23, 31 | 3eqtr4d 2811 | . 2 ⊢ (𝜑 → ((𝑁 ∘ 𝑃)‘0) = ((𝑁 ∘ 𝑃)‘(♯‘𝐸))) |
| 33 | iscycl 30437 | . 2 ⊢ (𝐸(Cycles‘𝐻)(𝑁 ∘ 𝑃) ↔ (𝐸(Paths‘𝐻)(𝑁 ∘ 𝑃) ∧ ((𝑁 ∘ 𝑃)‘0) = ((𝑁 ∘ 𝑃)‘(♯‘𝐸)))) | |
| 34 | 10, 32, 33 | sylanbrc 595 | 1 ⊢ (𝜑 → 𝐸(Cycles‘𝐻)(𝑁 ∘ 𝑃)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1572 ∈ wcel 2150 class class class wbr 5107 ↦ cmpt 5191 ◡ccnv 5656 dom cdm 5657 “ cima 5660 ∘ ccom 5661 ⟶wf 6561 ‘cfv 6565 (class class class)co 7450 0cc0 11238 ℕ0cn0 12645 ...cfz 13678 ♯chash 14514 Word cword 14698 Vtxcvtx 29633 iEdgciedg 29634 USPGraphcuspgr 29788 Walkscwlks 30236 Pathscpths 30354 Cyclesccycls 30431 GraphIso cgrim 49306 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ifp 1080 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-2o 8514 df-oadd 8517 df-er 8754 df-map 8886 df-pm 8887 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-dju 10018 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-n0 12646 df-xnn0 12719 df-z 12733 df-uz 13005 df-fz 13679 df-fzo 13828 df-hash 14515 df-word 14699 df-edg 29685 df-uhgr 29695 df-upgr 29719 df-uspgr 29790 df-wlks 30239 df-trls 30334 df-pths 30358 df-cycls 30433 df-grim 49309 |
| This theorem is used by: cycldlenngric 49359 |
| Copyright terms: Public domain | W3C validator |