| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > konigsbergiedgw | Structured version Visualization version GIF version | ||
| Description: The indexed edges of the Königsberg graph 𝐺 is a word over the pairs of vertices. (Contributed by AV, 28-Feb-2021.) |
| Ref | Expression |
|---|---|
| konigsberg.v | ⊢ 𝑉 = (0...3) |
| konigsberg.e | ⊢ 𝐸 = 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 |
| konigsberg.g | ⊢ 𝐺 = 〈𝑉, 𝐸〉 |
| Ref | Expression |
|---|---|
| konigsbergiedgw | ⊢ 𝐸 ∈ Word {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3nn0 12444 | . . . . . . 7 ⊢ 3 ∈ ℕ0 | |
| 2 | 0elfz 13567 | . . . . . . 7 ⊢ (3 ∈ ℕ0 → 0 ∈ (0...3)) | |
| 3 | 1, 2 | ax-mp 5 | . . . . . 6 ⊢ 0 ∈ (0...3) |
| 4 | 1nn0 12442 | . . . . . . 7 ⊢ 1 ∈ ℕ0 | |
| 5 | 1le3 12377 | . . . . . . 7 ⊢ 1 ≤ 3 | |
| 6 | elfz2nn0 13561 | . . . . . . 7 ⊢ (1 ∈ (0...3) ↔ (1 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 1 ≤ 3)) | |
| 7 | 4, 1, 5, 6 | mpbir3an 1343 | . . . . . 6 ⊢ 1 ∈ (0...3) |
| 8 | 0ne1 12241 | . . . . . 6 ⊢ 0 ≠ 1 | |
| 9 | 3, 7, 8 | umgrbi 29158 | . . . . 5 ⊢ {0, 1} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 10 | 9 | a1i 11 | . . . 4 ⊢ (⊤ → {0, 1} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 11 | 2nn0 12443 | . . . . . . 7 ⊢ 2 ∈ ℕ0 | |
| 12 | 2re 12244 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
| 13 | 3re 12250 | . . . . . . . 8 ⊢ 3 ∈ ℝ | |
| 14 | 2lt3 12337 | . . . . . . . 8 ⊢ 2 < 3 | |
| 15 | 12, 13, 14 | ltleii 11258 | . . . . . . 7 ⊢ 2 ≤ 3 |
| 16 | elfz2nn0 13561 | . . . . . . 7 ⊢ (2 ∈ (0...3) ↔ (2 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 2 ≤ 3)) | |
| 17 | 11, 1, 15, 16 | mpbir3an 1343 | . . . . . 6 ⊢ 2 ∈ (0...3) |
| 18 | 0ne2 12372 | . . . . . 6 ⊢ 0 ≠ 2 | |
| 19 | 3, 17, 18 | umgrbi 29158 | . . . . 5 ⊢ {0, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 20 | 19 | a1i 11 | . . . 4 ⊢ (⊤ → {0, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 21 | nn0fz0 13568 | . . . . . . 7 ⊢ (3 ∈ ℕ0 ↔ 3 ∈ (0...3)) | |
| 22 | 1, 21 | mpbi 230 | . . . . . 6 ⊢ 3 ∈ (0...3) |
| 23 | 3ne0 12276 | . . . . . . 7 ⊢ 3 ≠ 0 | |
| 24 | 23 | necomi 2984 | . . . . . 6 ⊢ 0 ≠ 3 |
| 25 | 3, 22, 24 | umgrbi 29158 | . . . . 5 ⊢ {0, 3} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 26 | 25 | a1i 11 | . . . 4 ⊢ (⊤ → {0, 3} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 27 | 1ne2 12373 | . . . . . 6 ⊢ 1 ≠ 2 | |
| 28 | 7, 17, 27 | umgrbi 29158 | . . . . 5 ⊢ {1, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 29 | 28 | a1i 11 | . . . 4 ⊢ (⊤ → {1, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 30 | 12, 14 | ltneii 11248 | . . . . . 6 ⊢ 2 ≠ 3 |
| 31 | 17, 22, 30 | umgrbi 29158 | . . . . 5 ⊢ {2, 3} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 32 | 31 | a1i 11 | . . . 4 ⊢ (⊤ → {2, 3} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 33 | 10, 20, 26, 29, 29, 32, 32 | s7cld 14827 | . . 3 ⊢ (⊤ → 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 ∈ Word {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 34 | 33 | mptru 1549 | . 2 ⊢ 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 ∈ Word {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 35 | konigsberg.e | . 2 ⊢ 𝐸 = 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 | |
| 36 | konigsberg.v | . . . . 5 ⊢ 𝑉 = (0...3) | |
| 37 | 36 | pweqi 4547 | . . . 4 ⊢ 𝒫 𝑉 = 𝒫 (0...3) |
| 38 | 37 | rabeqi 3400 | . . 3 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} = {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 39 | 38 | wrdeqi 14488 | . 2 ⊢ Word {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} = Word {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 40 | 34, 35, 39 | 3eltr4i 2848 | 1 ⊢ 𝐸 ∈ Word {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ⊤wtru 1543 ∈ wcel 2114 {crab 3387 𝒫 cpw 4531 {cpr 4559 〈cop 4563 class class class wbr 5074 ‘cfv 6487 (class class class)co 7356 0cc0 11027 1c1 11028 ≤ cle 11169 2c2 12225 3c3 12226 ℕ0cn0 12426 ...cfz 13450 ♯chash 14281 Word cword 14464 〈“cs7 14797 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2184 ax-ext 2707 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3060 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-int 4880 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-oadd 8398 df-er 8632 df-en 8883 df-dom 8884 df-sdom 8885 df-fin 8886 df-dju 9814 df-card 9852 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12164 df-2 12233 df-3 12234 df-n0 12427 df-z 12514 df-uz 12778 df-fz 13451 df-fzo 13598 df-hash 14282 df-word 14465 df-concat 14522 df-s1 14548 df-s2 14799 df-s3 14800 df-s4 14801 df-s5 14802 df-s6 14803 df-s7 14804 |
| This theorem is referenced by: konigsbergssiedgwpr 30307 konigsbergumgr 30309 |
| Copyright terms: Public domain | W3C validator |