Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > upgr1trld | Structured version Visualization version GIF version |
Description: In a pseudograph with two vertices and an edge connecting these two vertices, to go from one vertex to the other vertex via this edge is a trail. The two vertices need not be distinct (in the case of a loop). (Contributed by AV, 22-Jan-2021.) |
Ref | Expression |
---|---|
upgr1wlkd.p | ⊢ 𝑃 = 〈“𝑋𝑌”〉 |
upgr1wlkd.f | ⊢ 𝐹 = 〈“𝐽”〉 |
upgr1wlkd.x | ⊢ (𝜑 → 𝑋 ∈ (Vtx‘𝐺)) |
upgr1wlkd.y | ⊢ (𝜑 → 𝑌 ∈ (Vtx‘𝐺)) |
upgr1wlkd.j | ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌}) |
upgr1wlkd.g | ⊢ (𝜑 → 𝐺 ∈ UPGraph) |
Ref | Expression |
---|---|
upgr1trld | ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | upgr1wlkd.p | . 2 ⊢ 𝑃 = 〈“𝑋𝑌”〉 | |
2 | upgr1wlkd.f | . 2 ⊢ 𝐹 = 〈“𝐽”〉 | |
3 | upgr1wlkd.x | . 2 ⊢ (𝜑 → 𝑋 ∈ (Vtx‘𝐺)) | |
4 | upgr1wlkd.y | . 2 ⊢ (𝜑 → 𝑌 ∈ (Vtx‘𝐺)) | |
5 | upgr1wlkd.j | . . 3 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌}) | |
6 | 1, 2, 3, 4, 5 | upgr1wlkdlem1 27924 | . 2 ⊢ ((𝜑 ∧ 𝑋 = 𝑌) → ((iEdg‘𝐺)‘𝐽) = {𝑋}) |
7 | 1, 2, 3, 4, 5 | upgr1wlkdlem2 27925 | . 2 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽)) |
8 | eqid 2821 | . 2 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
9 | eqid 2821 | . 2 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
10 | 1, 2, 3, 4, 6, 7, 8, 9 | 1trld 27921 | 1 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 {cpr 4569 class class class wbr 5066 ‘cfv 6355 〈“cs1 13949 〈“cs2 14203 Vtxcvtx 26781 iEdgciedg 26782 UPGraphcupgr 26865 Trailsctrls 27472 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-ifp 1058 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-oadd 8106 df-er 8289 df-map 8408 df-pm 8409 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-card 9368 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-2 11701 df-n0 11899 df-z 11983 df-uz 12245 df-fz 12894 df-fzo 13035 df-hash 13692 df-word 13863 df-concat 13923 df-s1 13950 df-s2 14210 df-wlks 27381 df-trls 27474 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |