| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > upgrimspths | Structured version Visualization version GIF version | ||
| Description: Graph isomorphisms between simple pseudographs map simple paths onto simple paths. (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 𝐹 ↦ (◡𝐽‘(𝑁 “ (𝐼‘(𝐹‘𝑥))))) |
| upgrimspths.s | ⊢ (𝜑 → 𝐹(SPaths‘𝐺)𝑃) |
| Ref | Expression |
|---|---|
| upgrimspths | ⊢ (𝜑 → 𝐸(SPaths‘𝐻)(𝑁 ∘ 𝑃)) |
| 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 | upgrimspths.s | . . . 4 ⊢ (𝜑 → 𝐹(SPaths‘𝐺)𝑃) | |
| 8 | spthispth 30368 | . . . 4 ⊢ (𝐹(SPaths‘𝐺)𝑃 → 𝐹(Paths‘𝐺)𝑃) | |
| 9 | pthistrl 30367 | . . . 4 ⊢ (𝐹(Paths‘𝐺)𝑃 → 𝐹(Trails‘𝐺)𝑃) | |
| 10 | 7, 8, 9 | 3syl 19 | . . 3 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
| 11 | 1, 2, 3, 4, 5, 6, 10 | upgrimtrls 49337 | . 2 ⊢ (𝜑 → 𝐸(Trails‘𝐻)(𝑁 ∘ 𝑃)) |
| 12 | isspth 30366 | . . . . . 6 ⊢ (𝐹(SPaths‘𝐺)𝑃 ↔ (𝐹(Trails‘𝐺)𝑃 ∧ Fun ◡𝑃)) | |
| 13 | 12 | simprbi 503 | . . . . 5 ⊢ (𝐹(SPaths‘𝐺)𝑃 → Fun ◡𝑃) |
| 14 | 7, 13 | syl 18 | . . . 4 ⊢ (𝜑 → Fun ◡𝑃) |
| 15 | eqid 2766 | . . . . . 6 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 16 | eqid 2766 | . . . . . 6 ⊢ (Vtx‘𝐻) = (Vtx‘𝐻) | |
| 17 | 15, 16 | grimf1o 49315 | . . . . 5 ⊢ (𝑁 ∈ (𝐺 GraphIso 𝐻) → 𝑁:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻)) |
| 18 | dff1o3 6860 | . . . . . 6 ⊢ (𝑁:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) ↔ (𝑁:(Vtx‘𝐺)⟶onto(Vtx‘𝐻) ∧ Fun ◡𝑁)) | |
| 19 | 18 | simprbi 503 | . . . . 5 ⊢ (𝑁:(Vtx‘𝐺)⟶1-1onto(Vtx‘𝐻) → Fun ◡𝑁) |
| 20 | 5, 17, 19 | 3syl 19 | . . . 4 ⊢ (𝜑 → Fun ◡𝑁) |
| 21 | funco 6607 | . . . 4 ⊢ ((Fun ◡𝑃 ∧ Fun ◡𝑁) → Fun (◡𝑃 ∘ ◡𝑁)) | |
| 22 | 14, 20, 21 | syl2anc 596 | . . 3 ⊢ (𝜑 → Fun (◡𝑃 ∘ ◡𝑁)) |
| 23 | cnvco 5878 | . . . 4 ⊢ ◡(𝑁 ∘ 𝑃) = (◡𝑃 ∘ ◡𝑁) | |
| 24 | 23 | funeqi 6587 | . . 3 ⊢ (Fun ◡(𝑁 ∘ 𝑃) ↔ Fun (◡𝑃 ∘ ◡𝑁)) |
| 25 | 22, 24 | sylibr 237 | . 2 ⊢ (𝜑 → Fun ◡(𝑁 ∘ 𝑃)) |
| 26 | isspth 30366 | . 2 ⊢ (𝐸(SPaths‘𝐻)(𝑁 ∘ 𝑃) ↔ (𝐸(Trails‘𝐻)(𝑁 ∘ 𝑃) ∧ Fun ◡(𝑁 ∘ 𝑃))) | |
| 27 | 11, 25, 26 | sylanbrc 595 | 1 ⊢ (𝜑 → 𝐸(SPaths‘𝐻)(𝑁 ∘ 𝑃)) |
| 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 Fun wfun 6559 ⟶ontowfo 6563 ⟶1-1ontowf1o 6564 ‘cfv 6565 (class class class)co 7450 Vtxcvtx 29633 iEdgciedg 29634 USPGraphcuspgr 29788 Trailsctrls 30332 Pathscpths 30354 SPathscspths 30355 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-spths 30359 df-grim 49309 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |