![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > eupthfi | Structured version Visualization version GIF version |
Description: Any graph with an Eulerian path is of finite size, i.e. with a finite number of edges. (Contributed by Mario Carneiro, 7-Apr-2015.) (Revised by AV, 18-Feb-2021.) |
Ref | Expression |
---|---|
eupths.i | ⊢ 𝐼 = (iEdg‘𝐺) |
Ref | Expression |
---|---|
eupthfi | ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → dom 𝐼 ∈ Fin) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fzofi 13946 | . 2 ⊢ (0..^(♯‘𝐹)) ∈ Fin | |
2 | eupths.i | . . . 4 ⊢ 𝐼 = (iEdg‘𝐺) | |
3 | 2 | eupthf1o 29890 | . . 3 ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼) |
4 | ovex 7445 | . . . 4 ⊢ (0..^(♯‘𝐹)) ∈ V | |
5 | 4 | f1oen 8975 | . . 3 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼 → (0..^(♯‘𝐹)) ≈ dom 𝐼) |
6 | ensym 9005 | . . 3 ⊢ ((0..^(♯‘𝐹)) ≈ dom 𝐼 → dom 𝐼 ≈ (0..^(♯‘𝐹))) | |
7 | 3, 5, 6 | 3syl 18 | . 2 ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → dom 𝐼 ≈ (0..^(♯‘𝐹))) |
8 | enfii 9195 | . 2 ⊢ (((0..^(♯‘𝐹)) ∈ Fin ∧ dom 𝐼 ≈ (0..^(♯‘𝐹))) → dom 𝐼 ∈ Fin) | |
9 | 1, 7, 8 | sylancr 586 | 1 ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → dom 𝐼 ∈ Fin) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2105 class class class wbr 5148 dom cdm 5676 –1-1-onto→wf1o 6542 ‘cfv 6543 (class class class)co 7412 ≈ cen 8942 Fincfn 8945 0cc0 11116 ..^cfzo 13634 ♯chash 14297 iEdgciedg 28690 EulerPathsceupth 29883 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729 ax-cnex 11172 ax-resscn 11173 ax-1cn 11174 ax-icn 11175 ax-addcl 11176 ax-addrcl 11177 ax-mulcl 11178 ax-mulrcl 11179 ax-mulcom 11180 ax-addass 11181 ax-mulass 11182 ax-distr 11183 ax-i2m1 11184 ax-1ne0 11185 ax-1rid 11186 ax-rnegex 11187 ax-rrecex 11188 ax-cnre 11189 ax-pre-lttri 11190 ax-pre-lttrn 11191 ax-pre-ltadd 11192 ax-pre-mulgt0 11193 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7860 df-1st 7979 df-2nd 7980 df-frecs 8272 df-wrecs 8303 df-recs 8377 df-rdg 8416 df-1o 8472 df-er 8709 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-pnf 11257 df-mnf 11258 df-xr 11259 df-ltxr 11260 df-le 11261 df-sub 11453 df-neg 11454 df-nn 12220 df-n0 12480 df-z 12566 df-uz 12830 df-fz 13492 df-fzo 13635 df-wlks 29289 df-trls 29382 df-eupth 29884 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |