| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > konigsbergumgr | GIF version | ||
| Description: The Königsberg graph 𝐺 is a multigraph. (Contributed by AV, 28-Feb-2021.) (Revised by AV, 9-Mar-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 |
|---|---|
| konigsbergumgr | ⊢ 𝐺 ∈ UMGraph |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | konigsberg.v | . . 3 ⊢ 𝑉 = (0...3) | |
| 2 | konigsberg.e | . . 3 ⊢ 𝐸 = 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 | |
| 3 | konigsberg.g | . . 3 ⊢ 𝐺 = 〈𝑉, 𝐸〉 | |
| 4 | 1, 2, 3 | konigsbergiedgwen 16725 | . 2 ⊢ 𝐸 ∈ Word {𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o} |
| 5 | 0z 9655 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
| 6 | 3z 9673 | . . . . . . 7 ⊢ 3 ∈ ℤ | |
| 7 | fzfig 10867 | . . . . . . 7 ⊢ ((0 ∈ ℤ ∧ 3 ∈ ℤ) → (0...3) ∈ Fin) | |
| 8 | 5, 6, 7 | mp2an 430 | . . . . . 6 ⊢ (0...3) ∈ Fin |
| 9 | 1, 8 | eqeltri 2311 | . . . . 5 ⊢ 𝑉 ∈ Fin |
| 10 | 1z 9670 | . . . . . . . . . 10 ⊢ 1 ∈ ℤ | |
| 11 | prexg 4349 | . . . . . . . . . 10 ⊢ ((0 ∈ ℤ ∧ 1 ∈ ℤ) → {0, 1} ∈ V) | |
| 12 | 5, 10, 11 | mp2an 430 | . . . . . . . . 9 ⊢ {0, 1} ∈ V |
| 13 | 12 | a1i 9 | . . . . . . . 8 ⊢ (⊤ → {0, 1} ∈ V) |
| 14 | 2z 9672 | . . . . . . . . . 10 ⊢ 2 ∈ ℤ | |
| 15 | prexg 4349 | . . . . . . . . . 10 ⊢ ((0 ∈ ℤ ∧ 2 ∈ ℤ) → {0, 2} ∈ V) | |
| 16 | 5, 14, 15 | mp2an 430 | . . . . . . . . 9 ⊢ {0, 2} ∈ V |
| 17 | 16 | a1i 9 | . . . . . . . 8 ⊢ (⊤ → {0, 2} ∈ V) |
| 18 | prexg 4349 | . . . . . . . . . 10 ⊢ ((0 ∈ ℤ ∧ 3 ∈ ℤ) → {0, 3} ∈ V) | |
| 19 | 5, 6, 18 | mp2an 430 | . . . . . . . . 9 ⊢ {0, 3} ∈ V |
| 20 | 19 | a1i 9 | . . . . . . . 8 ⊢ (⊤ → {0, 3} ∈ V) |
| 21 | prexg 4349 | . . . . . . . . . 10 ⊢ ((1 ∈ ℤ ∧ 2 ∈ ℤ) → {1, 2} ∈ V) | |
| 22 | 10, 14, 21 | mp2an 430 | . . . . . . . . 9 ⊢ {1, 2} ∈ V |
| 23 | 22 | a1i 9 | . . . . . . . 8 ⊢ (⊤ → {1, 2} ∈ V) |
| 24 | prexg 4349 | . . . . . . . . . 10 ⊢ ((2 ∈ ℤ ∧ 3 ∈ ℤ) → {2, 3} ∈ V) | |
| 25 | 14, 6, 24 | mp2an 430 | . . . . . . . . 9 ⊢ {2, 3} ∈ V |
| 26 | 25 | a1i 9 | . . . . . . . 8 ⊢ (⊤ → {2, 3} ∈ V) |
| 27 | 13, 17, 20, 23, 23, 26, 26 | s7cld 11555 | . . . . . . 7 ⊢ (⊤ → 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 ∈ Word V) |
| 28 | 27 | mptru 1411 | . . . . . 6 ⊢ 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 ∈ Word V |
| 29 | 2, 28 | eqeltri 2311 | . . . . 5 ⊢ 𝐸 ∈ Word V |
| 30 | opexg 4368 | . . . . 5 ⊢ ((𝑉 ∈ Fin ∧ 𝐸 ∈ Word V) → 〈𝑉, 𝐸〉 ∈ V) | |
| 31 | 9, 29, 30 | mp2an 430 | . . . 4 ⊢ 〈𝑉, 𝐸〉 ∈ V |
| 32 | 3, 31 | eqeltri 2311 | . . 3 ⊢ 𝐺 ∈ V |
| 33 | 1, 2, 3 | konigsbergvtx 16723 | . . . . 5 ⊢ (Vtx‘𝐺) = (0...3) |
| 34 | 1, 33 | eqtr4i 2262 | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) |
| 35 | 1, 2, 3 | konigsbergiedg 16724 | . . . . 5 ⊢ (iEdg‘𝐺) = 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 |
| 36 | 2, 35 | eqtr4i 2262 | . . . 4 ⊢ 𝐸 = (iEdg‘𝐺) |
| 37 | 34, 36 | wrdumgren 16347 | . . 3 ⊢ ((𝐺 ∈ V ∧ 𝐸 ∈ Word V) → (𝐺 ∈ UMGraph ↔ 𝐸 ∈ Word {𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o})) |
| 38 | 32, 29, 37 | mp2an 430 | . 2 ⊢ (𝐺 ∈ UMGraph ↔ 𝐸 ∈ Word {𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o}) |
| 39 | 4, 38 | mpbir 146 | 1 ⊢ 𝐺 ∈ UMGraph |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ↔ wb 105 = wceq 1402 ⊤wtru 1403 ∈ wcel 2209 {crab 2532 Vcvv 2821 𝒫 cpw 3688 {cpr 3710 〈cop 3712 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 2oc2o 6681 ≈ cen 7020 Fincfn 7022 0cc0 8179 1c1 8180 2c2 9355 3c3 9356 ℤcz 9644 ...cfz 10411 Word cword 11304 〈“cs7 11526 Vtxcvtx 16253 iEdgciedg 16254 UMGraphcumgr 16333 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 |
| This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-1o 6687 df-2o 6688 df-er 6807 df-en 7023 df-dom 7024 df-fin 7025 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-inn 9305 df-2 9363 df-3 9364 df-4 9365 df-5 9366 df-6 9367 df-7 9368 df-8 9369 df-9 9370 df-n0 9564 df-z 9645 df-dec 9778 df-uz 9922 df-fz 10412 df-fzo 10550 df-ihash 11215 df-word 11305 df-concat 11359 df-s1 11384 df-s2 11528 df-s3 11529 df-s4 11530 df-s5 11531 df-s6 11532 df-s7 11533 df-ndx 13355 df-slot 13356 df-base 13358 df-edgf 16246 df-vtx 16255 df-iedg 16256 df-umgren 16335 |
| This theorem is used by: konigsberglem5 16733 konigsberg 16734 |
| Copyright terms: Public domain | W3C validator |