| 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 12528 | . . . . . . 7 ⊢ 3 ∈ ℕ0 | |
| 2 | 0elfz 13659 | . . . . . . 7 ⊢ (3 ∈ ℕ0 → 0 ∈ (0...3)) | |
| 3 | 1, 2 | ax-mp 5 | . . . . . 6 ⊢ 0 ∈ (0...3) |
| 4 | 1nn0 12526 | . . . . . . 7 ⊢ 1 ∈ ℕ0 | |
| 5 | 1le3 12461 | . . . . . . 7 ⊢ 1 ≤ 3 | |
| 6 | elfz2nn0 13653 | . . . . . . 7 ⊢ (1 ∈ (0...3) ↔ (1 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 1 ≤ 3)) | |
| 7 | 4, 1, 5, 6 | mpbir3an 1359 | . . . . . 6 ⊢ 1 ∈ (0...3) |
| 8 | 0ne1 12318 | . . . . . 6 ⊢ 0 ≠ 1 | |
| 9 | 3, 7, 8 | umgrbi 29462 | . . . . 5 ⊢ {0, 1} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 10 | 9 | a1i 11 | . . . 4 ⊢ (⊤ → {0, 1} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 11 | 2nn0 12527 | . . . . . . 7 ⊢ 2 ∈ ℕ0 | |
| 12 | 2re 12321 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
| 13 | 3re 12327 | . . . . . . . 8 ⊢ 3 ∈ ℝ | |
| 14 | 2lt3 12420 | . . . . . . . 8 ⊢ 2 < 3 | |
| 15 | 12, 13, 14 | ltleii 11339 | . . . . . . 7 ⊢ 2 ≤ 3 |
| 16 | elfz2nn0 13653 | . . . . . . 7 ⊢ (2 ∈ (0...3) ↔ (2 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 2 ≤ 3)) | |
| 17 | 11, 1, 15, 16 | mpbir3an 1359 | . . . . . 6 ⊢ 2 ∈ (0...3) |
| 18 | 0ne2 12456 | . . . . . 6 ⊢ 0 ≠ 2 | |
| 19 | 3, 17, 18 | umgrbi 29462 | . . . . 5 ⊢ {0, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 20 | 19 | a1i 11 | . . . 4 ⊢ (⊤ → {0, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 21 | nn0fz0 13660 | . . . . . . 7 ⊢ (3 ∈ ℕ0 ↔ 3 ∈ (0...3)) | |
| 22 | 1, 21 | mpbi 233 | . . . . . 6 ⊢ 3 ∈ (0...3) |
| 23 | 3ne0 12356 | . . . . . . 7 ⊢ 3 ≠ 0 | |
| 24 | 23 | necomi 3011 | . . . . . 6 ⊢ 0 ≠ 3 |
| 25 | 3, 22, 24 | umgrbi 29462 | . . . . 5 ⊢ {0, 3} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 26 | 25 | a1i 11 | . . . 4 ⊢ (⊤ → {0, 3} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 27 | 1ne2 12457 | . . . . . 6 ⊢ 1 ≠ 2 | |
| 28 | 7, 17, 27 | umgrbi 29462 | . . . . 5 ⊢ {1, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 29 | 28 | a1i 11 | . . . 4 ⊢ (⊤ → {1, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 30 | 12, 14 | ltneii 11329 | . . . . . 6 ⊢ 2 ≠ 3 |
| 31 | 17, 22, 30 | umgrbi 29462 | . . . . 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 14920 | . . 3 ⊢ (⊤ → 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 ∈ Word {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 34 | 33 | mptru 1576 | . 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 4577 | . . . 4 ⊢ 𝒫 𝑉 = 𝒫 (0...3) |
| 38 | 37 | rabeqi 3428 | . . 3 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} = {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 39 | 38 | wrdeqi 14581 | . 2 ⊢ Word {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} = Word {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 40 | 34, 35, 39 | 3eltr4i 2875 | 1 ⊢ 𝐸 ∈ Word {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ⊤wtru 1570 ∈ wcel 2142 {crab 3415 𝒫 cpw 4561 {cpr 4590 〈cop 4594 class class class wbr 5108 ‘cfv 6536 (class class class)co 7412 0cc0 11106 1c1 11107 ≤ cle 11250 2c2 12301 3c3 12302 ℕ0cn0 12510 ...cfz 13541 ♯chash 14373 Word cword 14557 〈“cs7 14890 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-oadd 8455 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-dju 9894 df-card 9932 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-nn 12240 df-2 12309 df-3 12310 df-n0 12511 df-z 12598 df-uz 12869 df-fz 13542 df-fzo 13690 df-hash 14374 df-word 14558 df-concat 14615 df-s1 14641 df-s2 14892 df-s3 14893 df-s4 14894 df-s5 14895 df-s6 14896 df-s7 14897 |
| This theorem is used by: konigsbergssiedgwpr 30611 konigsbergumgr 30613 |
| Copyright terms: Public domain | W3C validator |