| 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 12494 | . . . . . . 7 ⊢ 3 ∈ ℕ0 | |
| 2 | 0elfz 13624 | . . . . . . 7 ⊢ (3 ∈ ℕ0 → 0 ∈ (0...3)) | |
| 3 | 1, 2 | ax-mp 5 | . . . . . 6 ⊢ 0 ∈ (0...3) |
| 4 | 1nn0 12492 | . . . . . . 7 ⊢ 1 ∈ ℕ0 | |
| 5 | 1le3 12427 | . . . . . . 7 ⊢ 1 ≤ 3 | |
| 6 | elfz2nn0 13618 | . . . . . . 7 ⊢ (1 ∈ (0...3) ↔ (1 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 1 ≤ 3)) | |
| 7 | 4, 1, 5, 6 | mpbir3an 1354 | . . . . . 6 ⊢ 1 ∈ (0...3) |
| 8 | 0ne1 12284 | . . . . . 6 ⊢ 0 ≠ 1 | |
| 9 | 3, 7, 8 | umgrbi 29246 | . . . . 5 ⊢ {0, 1} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 10 | 9 | a1i 11 | . . . 4 ⊢ (⊤ → {0, 1} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 11 | 2nn0 12493 | . . . . . . 7 ⊢ 2 ∈ ℕ0 | |
| 12 | 2re 12287 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
| 13 | 3re 12293 | . . . . . . . 8 ⊢ 3 ∈ ℝ | |
| 14 | 2lt3 12386 | . . . . . . . 8 ⊢ 2 < 3 | |
| 15 | 12, 13, 14 | ltleii 11301 | . . . . . . 7 ⊢ 2 ≤ 3 |
| 16 | elfz2nn0 13618 | . . . . . . 7 ⊢ (2 ∈ (0...3) ↔ (2 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 2 ≤ 3)) | |
| 17 | 11, 1, 15, 16 | mpbir3an 1354 | . . . . . 6 ⊢ 2 ∈ (0...3) |
| 18 | 0ne2 12422 | . . . . . 6 ⊢ 0 ≠ 2 | |
| 19 | 3, 17, 18 | umgrbi 29246 | . . . . 5 ⊢ {0, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 20 | 19 | a1i 11 | . . . 4 ⊢ (⊤ → {0, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 21 | nn0fz0 13625 | . . . . . . 7 ⊢ (3 ∈ ℕ0 ↔ 3 ∈ (0...3)) | |
| 22 | 1, 21 | mpbi 232 | . . . . . 6 ⊢ 3 ∈ (0...3) |
| 23 | 3ne0 12322 | . . . . . . 7 ⊢ 3 ≠ 0 | |
| 24 | 23 | necomi 3010 | . . . . . 6 ⊢ 0 ≠ 3 |
| 25 | 3, 22, 24 | umgrbi 29246 | . . . . 5 ⊢ {0, 3} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 26 | 25 | a1i 11 | . . . 4 ⊢ (⊤ → {0, 3} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 27 | 1ne2 12423 | . . . . . 6 ⊢ 1 ≠ 2 | |
| 28 | 7, 17, 27 | umgrbi 29246 | . . . . 5 ⊢ {1, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 29 | 28 | a1i 11 | . . . 4 ⊢ (⊤ → {1, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 30 | 12, 14 | ltneii 11291 | . . . . . 6 ⊢ 2 ≠ 3 |
| 31 | 17, 22, 30 | umgrbi 29246 | . . . . 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 14884 | . . 3 ⊢ (⊤ → 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 ∈ Word {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 34 | 33 | mptru 1566 | . 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 4570 | . . . 4 ⊢ 𝒫 𝑉 = 𝒫 (0...3) |
| 38 | 37 | rabeqi 3426 | . . 3 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} = {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 39 | 38 | wrdeqi 14545 | . 2 ⊢ Word {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} = Word {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 40 | 34, 35, 39 | 3eltr4i 2874 | 1 ⊢ 𝐸 ∈ Word {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1559 ⊤wtru 1560 ∈ wcel 2141 {crab 3413 𝒫 cpw 4554 {cpr 4583 〈cop 4587 class class class wbr 5099 ‘cfv 6515 (class class class)co 7390 0cc0 11068 1c1 11069 ≤ cle 11212 2c2 12267 3c3 12268 ℕ0cn0 12476 ...cfz 13507 ♯chash 14338 Word cword 14521 〈“cs7 14854 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7712 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7841 df-1st 7964 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-1o 8430 df-oadd 8434 df-er 8671 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-dju 9854 df-card 9892 df-pnf 11213 df-mnf 11214 df-xr 11215 df-ltxr 11216 df-le 11217 df-sub 11411 df-neg 11412 df-nn 12206 df-2 12275 df-3 12276 df-n0 12477 df-z 12564 df-uz 12835 df-fz 13508 df-fzo 13655 df-hash 14339 df-word 14522 df-concat 14579 df-s1 14605 df-s2 14856 df-s3 14857 df-s4 14858 df-s5 14859 df-s6 14860 df-s7 14861 |
| This theorem is referenced by: konigsbergssiedgwpr 30395 konigsbergumgr 30397 |
| Copyright terms: Public domain | W3C validator |