| 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 12624 | . . . . . . 7 ⊢ 3 ∈ ℕ0 | |
| 2 | 0elfz 13758 | . . . . . . 7 ⊢ (3 ∈ ℕ0 → 0 ∈ (0...3)) | |
| 3 | 1, 2 | ax-mp 5 | . . . . . 6 ⊢ 0 ∈ (0...3) |
| 4 | 1nn0 12622 | . . . . . . 7 ⊢ 1 ∈ ℕ0 | |
| 5 | 1le3 12557 | . . . . . . 7 ⊢ 1 ≤ 3 | |
| 6 | elfz2nn0 13752 | . . . . . . 7 ⊢ (1 ∈ (0...3) ↔ (1 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 1 ≤ 3)) | |
| 7 | 4, 1, 5, 6 | mpbir3an 1360 | . . . . . 6 ⊢ 1 ∈ (0...3) |
| 8 | 0ne1 12414 | . . . . . 6 ⊢ 0 ≠ 1 | |
| 9 | 3, 7, 8 | umgrbi 29679 | . . . . 5 ⊢ {0, 1} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 10 | 9 | a1i 11 | . . . 4 ⊢ (⊤ → {0, 1} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 11 | 2nn0 12623 | . . . . . . 7 ⊢ 2 ∈ ℕ0 | |
| 12 | 2re 12417 | . . . . . . . 8 ⊢ 2 ∈ ℝ | |
| 13 | 3re 12423 | . . . . . . . 8 ⊢ 3 ∈ ℝ | |
| 14 | 2lt3 12516 | . . . . . . . 8 ⊢ 2 < 3 | |
| 15 | 12, 13, 14 | ltleii 11433 | . . . . . . 7 ⊢ 2 ≤ 3 |
| 16 | elfz2nn0 13752 | . . . . . . 7 ⊢ (2 ∈ (0...3) ↔ (2 ∈ ℕ0 ∧ 3 ∈ ℕ0 ∧ 2 ≤ 3)) | |
| 17 | 11, 1, 15, 16 | mpbir3an 1360 | . . . . . 6 ⊢ 2 ∈ (0...3) |
| 18 | 0ne2 12552 | . . . . . 6 ⊢ 0 ≠ 2 | |
| 19 | 3, 17, 18 | umgrbi 29679 | . . . . 5 ⊢ {0, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 20 | 19 | a1i 11 | . . . 4 ⊢ (⊤ → {0, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 21 | nn0fz0 13759 | . . . . . . 7 ⊢ (3 ∈ ℕ0 ↔ 3 ∈ (0...3)) | |
| 22 | 1, 21 | mpbi 233 | . . . . . 6 ⊢ 3 ∈ (0...3) |
| 23 | 3ne0 12452 | . . . . . . 7 ⊢ 3 ≠ 0 | |
| 24 | 23 | necomi 3009 | . . . . . 6 ⊢ 0 ≠ 3 |
| 25 | 3, 22, 24 | umgrbi 29679 | . . . . 5 ⊢ {0, 3} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 26 | 25 | a1i 11 | . . . 4 ⊢ (⊤ → {0, 3} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 27 | 1ne2 12553 | . . . . . 6 ⊢ 1 ≠ 2 | |
| 28 | 7, 17, 27 | umgrbi 29679 | . . . . 5 ⊢ {1, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 29 | 28 | a1i 11 | . . . 4 ⊢ (⊤ → {1, 2} ∈ {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2}) |
| 30 | 12, 14 | ltneii 11423 | . . . . . 6 ⊢ 2 ≠ 3 |
| 31 | 17, 22, 30 | umgrbi 29679 | . . . . 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 15027 | . . 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 4572 | . . . 4 ⊢ 𝒫 𝑉 = 𝒫 (0...3) |
| 38 | 37 | rabeqi 3425 | . . 3 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} = {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 39 | 38 | wrdeqi 14682 | . 2 ⊢ Word {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} = Word {𝑥 ∈ 𝒫 (0...3) ∣ (♯‘𝑥) = 2} |
| 40 | 34, 35, 39 | 3eltr4i 2873 | 1 ⊢ 𝐸 ∈ Word {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 2} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ⊤wtru 1570 ∈ wcel 2144 {crab 3412 𝒫 cpw 4556 {cpr 4585 〈cop 4589 class class class wbr 5102 ‘cfv 6538 (class class class)co 7420 0cc0 11200 1c1 11201 ≤ cle 11344 2c2 12397 3c3 12398 ℕ0cn0 12606 ...cfz 13639 ♯chash 14474 Word cword 14658 〈“cs7 14997 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-oadd 8480 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-dju 9982 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-3 12406 df-n0 12607 df-z 12694 df-uz 12966 df-fz 13640 df-fzo 13789 df-hash 14475 df-word 14659 df-concat 14716 df-s1 14743 df-s2 14999 df-s3 15000 df-s4 15001 df-s5 15002 df-s6 15003 df-s7 15004 |
| This theorem is used by: konigsbergssiedgwpr 30850 konigsbergumgr 30852 |
| Copyright terms: Public domain | W3C validator |