Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 0ewlk | Structured version Visualization version GIF version |
Description: The empty set (empty sequence of edges) is an s-walk of edges for all s. (Contributed by AV, 4-Jan-2021.) |
Ref | Expression |
---|---|
0ewlk | ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ ℕ0*) → ∅ ∈ (𝐺 EdgWalks 𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wrd0 14122 | . . 3 ⊢ ∅ ∈ Word dom (iEdg‘𝐺) | |
2 | ral0 4439 | . . . 4 ⊢ ∀𝑘 ∈ ∅ 𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(∅‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(∅‘𝑘)))) | |
3 | hash0 13962 | . . . . . . 7 ⊢ (♯‘∅) = 0 | |
4 | 3 | oveq2i 7243 | . . . . . 6 ⊢ (1..^(♯‘∅)) = (1..^0) |
5 | 0le1 11380 | . . . . . . 7 ⊢ 0 ≤ 1 | |
6 | 1z 12232 | . . . . . . . 8 ⊢ 1 ∈ ℤ | |
7 | 0z 12212 | . . . . . . . 8 ⊢ 0 ∈ ℤ | |
8 | fzon 13288 | . . . . . . . 8 ⊢ ((1 ∈ ℤ ∧ 0 ∈ ℤ) → (0 ≤ 1 ↔ (1..^0) = ∅)) | |
9 | 6, 7, 8 | mp2an 692 | . . . . . . 7 ⊢ (0 ≤ 1 ↔ (1..^0) = ∅) |
10 | 5, 9 | mpbi 233 | . . . . . 6 ⊢ (1..^0) = ∅ |
11 | 4, 10 | eqtri 2766 | . . . . 5 ⊢ (1..^(♯‘∅)) = ∅ |
12 | 11 | raleqi 3336 | . . . 4 ⊢ (∀𝑘 ∈ (1..^(♯‘∅))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(∅‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(∅‘𝑘)))) ↔ ∀𝑘 ∈ ∅ 𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(∅‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(∅‘𝑘))))) |
13 | 2, 12 | mpbir 234 | . . 3 ⊢ ∀𝑘 ∈ (1..^(♯‘∅))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(∅‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(∅‘𝑘)))) |
14 | 1, 13 | pm3.2i 474 | . 2 ⊢ (∅ ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘∅))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(∅‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(∅‘𝑘))))) |
15 | 0ex 5215 | . . 3 ⊢ ∅ ∈ V | |
16 | eqid 2738 | . . . 4 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
17 | 16 | isewlk 27717 | . . 3 ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ ℕ0* ∧ ∅ ∈ V) → (∅ ∈ (𝐺 EdgWalks 𝑆) ↔ (∅ ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘∅))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(∅‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(∅‘𝑘))))))) |
18 | 15, 17 | mp3an3 1452 | . 2 ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ ℕ0*) → (∅ ∈ (𝐺 EdgWalks 𝑆) ↔ (∅ ∈ Word dom (iEdg‘𝐺) ∧ ∀𝑘 ∈ (1..^(♯‘∅))𝑆 ≤ (♯‘(((iEdg‘𝐺)‘(∅‘(𝑘 − 1))) ∩ ((iEdg‘𝐺)‘(∅‘𝑘))))))) |
19 | 14, 18 | mpbiri 261 | 1 ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ ℕ0*) → ∅ ∈ (𝐺 EdgWalks 𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1543 ∈ wcel 2111 ∀wral 3062 Vcvv 3421 ∩ cin 3880 ∅c0 4252 class class class wbr 5068 dom cdm 5566 ‘cfv 6398 (class class class)co 7232 0cc0 10754 1c1 10755 ≤ cle 10893 − cmin 11087 ℕ0*cxnn0 12187 ℤcz 12201 ..^cfzo 13263 ♯chash 13924 Word cword 14097 iEdgciedg 27115 EdgWalks cewlks 27710 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2159 ax-12 2176 ax-ext 2709 ax-rep 5194 ax-sep 5207 ax-nul 5214 ax-pow 5273 ax-pr 5337 ax-un 7542 ax-cnex 10810 ax-resscn 10811 ax-1cn 10812 ax-icn 10813 ax-addcl 10814 ax-addrcl 10815 ax-mulcl 10816 ax-mulrcl 10817 ax-mulcom 10818 ax-addass 10819 ax-mulass 10820 ax-distr 10821 ax-i2m1 10822 ax-1ne0 10823 ax-1rid 10824 ax-rnegex 10825 ax-rrecex 10826 ax-cnre 10827 ax-pre-lttri 10828 ax-pre-lttrn 10829 ax-pre-ltadd 10830 ax-pre-mulgt0 10831 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2072 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3067 df-rex 3068 df-reu 3069 df-rab 3071 df-v 3423 df-sbc 3710 df-csb 3827 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4253 df-if 4455 df-pw 4530 df-sn 4557 df-pr 4559 df-tp 4561 df-op 4563 df-uni 4835 df-int 4875 df-iun 4921 df-br 5069 df-opab 5131 df-mpt 5151 df-tr 5177 df-id 5470 df-eprel 5475 df-po 5483 df-so 5484 df-fr 5524 df-we 5526 df-xp 5572 df-rel 5573 df-cnv 5574 df-co 5575 df-dm 5576 df-rn 5577 df-res 5578 df-ima 5579 df-pred 6176 df-ord 6234 df-on 6235 df-lim 6236 df-suc 6237 df-iota 6356 df-fun 6400 df-fn 6401 df-f 6402 df-f1 6403 df-fo 6404 df-f1o 6405 df-fv 6406 df-riota 7189 df-ov 7235 df-oprab 7236 df-mpo 7237 df-om 7664 df-1st 7780 df-2nd 7781 df-wrecs 8068 df-recs 8129 df-rdg 8167 df-1o 8223 df-er 8412 df-map 8531 df-en 8648 df-dom 8649 df-sdom 8650 df-fin 8651 df-card 9580 df-pnf 10894 df-mnf 10895 df-xr 10896 df-ltxr 10897 df-le 10898 df-sub 11089 df-neg 11090 df-nn 11856 df-n0 12116 df-z 12202 df-uz 12464 df-fz 13121 df-fzo 13264 df-hash 13925 df-word 14098 df-ewlks 27713 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |