| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eulerpath | Structured version Visualization version GIF version | ||
| Description: A pseudograph with an Eulerian path has either zero or two vertices of odd degree. (Contributed by Mario Carneiro, 7-Apr-2015.) (Revised by AV, 26-Feb-2021.) |
| Ref | Expression |
|---|---|
| eulerpathpr.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| eulerpath | ⊢ ((𝐺 ∈ UPGraph ∧ (EulerPaths‘𝐺) ≠ ∅) → (♯‘{𝑥 ∈ 𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘𝐺)‘𝑥)}) ∈ {0, 2}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | releupth 30135 | . . . . . 6 ⊢ Rel (EulerPaths‘𝐺) | |
| 2 | reldm0 5899 | . . . . . 6 ⊢ (Rel (EulerPaths‘𝐺) → ((EulerPaths‘𝐺) = ∅ ↔ dom (EulerPaths‘𝐺) = ∅)) | |
| 3 | 1, 2 | ax-mp 5 | . . . . 5 ⊢ ((EulerPaths‘𝐺) = ∅ ↔ dom (EulerPaths‘𝐺) = ∅) |
| 4 | 3 | necon3bii 2979 | . . . 4 ⊢ ((EulerPaths‘𝐺) ≠ ∅ ↔ dom (EulerPaths‘𝐺) ≠ ∅) |
| 5 | n0 4324 | . . . 4 ⊢ (dom (EulerPaths‘𝐺) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ dom (EulerPaths‘𝐺)) | |
| 6 | 4, 5 | bitri 275 | . . 3 ⊢ ((EulerPaths‘𝐺) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ dom (EulerPaths‘𝐺)) |
| 7 | vex 3459 | . . . . . 6 ⊢ 𝑓 ∈ V | |
| 8 | 7 | eldm 5872 | . . . . 5 ⊢ (𝑓 ∈ dom (EulerPaths‘𝐺) ↔ ∃𝑝 𝑓(EulerPaths‘𝐺)𝑝) |
| 9 | eulerpathpr.v | . . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 10 | 9 | eulerpathpr 30176 | . . . . . . 7 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑓(EulerPaths‘𝐺)𝑝) → (♯‘{𝑥 ∈ 𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘𝐺)‘𝑥)}) ∈ {0, 2}) |
| 11 | 10 | expcom 413 | . . . . . 6 ⊢ (𝑓(EulerPaths‘𝐺)𝑝 → (𝐺 ∈ UPGraph → (♯‘{𝑥 ∈ 𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘𝐺)‘𝑥)}) ∈ {0, 2})) |
| 12 | 11 | exlimiv 1930 | . . . . 5 ⊢ (∃𝑝 𝑓(EulerPaths‘𝐺)𝑝 → (𝐺 ∈ UPGraph → (♯‘{𝑥 ∈ 𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘𝐺)‘𝑥)}) ∈ {0, 2})) |
| 13 | 8, 12 | sylbi 217 | . . . 4 ⊢ (𝑓 ∈ dom (EulerPaths‘𝐺) → (𝐺 ∈ UPGraph → (♯‘{𝑥 ∈ 𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘𝐺)‘𝑥)}) ∈ {0, 2})) |
| 14 | 13 | exlimiv 1930 | . . 3 ⊢ (∃𝑓 𝑓 ∈ dom (EulerPaths‘𝐺) → (𝐺 ∈ UPGraph → (♯‘{𝑥 ∈ 𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘𝐺)‘𝑥)}) ∈ {0, 2})) |
| 15 | 6, 14 | sylbi 217 | . 2 ⊢ ((EulerPaths‘𝐺) ≠ ∅ → (𝐺 ∈ UPGraph → (♯‘{𝑥 ∈ 𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘𝐺)‘𝑥)}) ∈ {0, 2})) |
| 16 | 15 | impcom 407 | 1 ⊢ ((𝐺 ∈ UPGraph ∧ (EulerPaths‘𝐺) ≠ ∅) → (♯‘{𝑥 ∈ 𝑉 ∣ ¬ 2 ∥ ((VtxDeg‘𝐺)‘𝑥)}) ∈ {0, 2}) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ≠ wne 2927 {crab 3411 ∅c0 4304 {cpr 4599 class class class wbr 5115 dom cdm 5646 Rel wrel 5651 ‘cfv 6519 0cc0 11086 2c2 12252 ♯chash 14305 ∥ cdvds 16229 Vtxcvtx 28930 UPGraphcupgr 29014 VtxDegcvtxdg 29400 EulerPathsceupth 30133 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5242 ax-sep 5259 ax-nul 5269 ax-pow 5328 ax-pr 5395 ax-un 7718 ax-cnex 11142 ax-resscn 11143 ax-1cn 11144 ax-icn 11145 ax-addcl 11146 ax-addrcl 11147 ax-mulcl 11148 ax-mulrcl 11149 ax-mulcom 11150 ax-addass 11151 ax-mulass 11152 ax-distr 11153 ax-i2m1 11154 ax-1ne0 11155 ax-1rid 11156 ax-rnegex 11157 ax-rrecex 11158 ax-cnre 11159 ax-pre-lttri 11160 ax-pre-lttrn 11161 ax-pre-ltadd 11162 ax-pre-mulgt0 11163 ax-pre-sup 11164 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-ifp 1063 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2880 df-ne 2928 df-nel 3032 df-ral 3047 df-rex 3056 df-rmo 3357 df-reu 3358 df-rab 3412 df-v 3457 df-sbc 3762 df-csb 3871 df-dif 3925 df-un 3927 df-in 3929 df-ss 3939 df-pss 3942 df-nul 4305 df-if 4497 df-pw 4573 df-sn 4598 df-pr 4600 df-op 4604 df-uni 4880 df-int 4919 df-iun 4965 df-br 5116 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5541 df-eprel 5546 df-po 5554 df-so 5555 df-fr 5599 df-we 5601 df-xp 5652 df-rel 5653 df-cnv 5654 df-co 5655 df-dm 5656 df-rn 5657 df-res 5658 df-ima 5659 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6472 df-fun 6521 df-fn 6522 df-f 6523 df-f1 6524 df-fo 6525 df-f1o 6526 df-fv 6527 df-riota 7351 df-ov 7397 df-oprab 7398 df-mpo 7399 df-om 7851 df-1st 7977 df-2nd 7978 df-frecs 8269 df-wrecs 8300 df-recs 8349 df-rdg 8387 df-1o 8443 df-2o 8444 df-oadd 8447 df-er 8682 df-map 8805 df-pm 8806 df-en 8923 df-dom 8924 df-sdom 8925 df-fin 8926 df-sup 9411 df-inf 9412 df-dju 9872 df-card 9910 df-pnf 11228 df-mnf 11229 df-xr 11230 df-ltxr 11231 df-le 11232 df-sub 11425 df-neg 11426 df-div 11852 df-nn 12198 df-2 12260 df-3 12261 df-n0 12459 df-xnn0 12532 df-z 12546 df-uz 12810 df-rp 12966 df-xadd 13086 df-fz 13482 df-fzo 13629 df-seq 13977 df-exp 14037 df-hash 14306 df-word 14489 df-cj 15075 df-re 15076 df-im 15077 df-sqrt 15211 df-abs 15212 df-dvds 16230 df-vtx 28932 df-iedg 28933 df-edg 28982 df-uhgr 28992 df-ushgr 28993 df-upgr 29016 df-uspgr 29084 df-vtxdg 29401 df-wlks 29534 df-trls 29627 df-eupth 30134 |
| This theorem is referenced by: konigsberg 30193 |
| Copyright terms: Public domain | W3C validator |