| 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 16354 | . 2 ⊢ 𝐸 ∈ Word {𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o} |
| 5 | 0z 9490 | . . . . . . 7 ⊢ 0 ∈ ℤ | |
| 6 | 3z 9508 | . . . . . . 7 ⊢ 3 ∈ ℤ | |
| 7 | fzfig 10693 | . . . . . . 7 ⊢ ((0 ∈ ℤ ∧ 3 ∈ ℤ) → (0...3) ∈ Fin) | |
| 8 | 5, 6, 7 | mp2an 426 | . . . . . 6 ⊢ (0...3) ∈ Fin |
| 9 | 1, 8 | eqeltri 2304 | . . . . 5 ⊢ 𝑉 ∈ Fin |
| 10 | 1z 9505 | . . . . . . . . . 10 ⊢ 1 ∈ ℤ | |
| 11 | prexg 4301 | . . . . . . . . . 10 ⊢ ((0 ∈ ℤ ∧ 1 ∈ ℤ) → {0, 1} ∈ V) | |
| 12 | 5, 10, 11 | mp2an 426 | . . . . . . . . 9 ⊢ {0, 1} ∈ V |
| 13 | 12 | a1i 9 | . . . . . . . 8 ⊢ (⊤ → {0, 1} ∈ V) |
| 14 | 2z 9507 | . . . . . . . . . 10 ⊢ 2 ∈ ℤ | |
| 15 | prexg 4301 | . . . . . . . . . 10 ⊢ ((0 ∈ ℤ ∧ 2 ∈ ℤ) → {0, 2} ∈ V) | |
| 16 | 5, 14, 15 | mp2an 426 | . . . . . . . . 9 ⊢ {0, 2} ∈ V |
| 17 | 16 | a1i 9 | . . . . . . . 8 ⊢ (⊤ → {0, 2} ∈ V) |
| 18 | prexg 4301 | . . . . . . . . . 10 ⊢ ((0 ∈ ℤ ∧ 3 ∈ ℤ) → {0, 3} ∈ V) | |
| 19 | 5, 6, 18 | mp2an 426 | . . . . . . . . 9 ⊢ {0, 3} ∈ V |
| 20 | 19 | a1i 9 | . . . . . . . 8 ⊢ (⊤ → {0, 3} ∈ V) |
| 21 | prexg 4301 | . . . . . . . . . 10 ⊢ ((1 ∈ ℤ ∧ 2 ∈ ℤ) → {1, 2} ∈ V) | |
| 22 | 10, 14, 21 | mp2an 426 | . . . . . . . . 9 ⊢ {1, 2} ∈ V |
| 23 | 22 | a1i 9 | . . . . . . . 8 ⊢ (⊤ → {1, 2} ∈ V) |
| 24 | prexg 4301 | . . . . . . . . . 10 ⊢ ((2 ∈ ℤ ∧ 3 ∈ ℤ) → {2, 3} ∈ V) | |
| 25 | 14, 6, 24 | mp2an 426 | . . . . . . . . 9 ⊢ {2, 3} ∈ V |
| 26 | 25 | a1i 9 | . . . . . . . 8 ⊢ (⊤ → {2, 3} ∈ V) |
| 27 | 13, 17, 20, 23, 23, 26, 26 | s7cld 11368 | . . . . . . 7 ⊢ (⊤ → 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 ∈ Word V) |
| 28 | 27 | mptru 1406 | . . . . . 6 ⊢ 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 ∈ Word V |
| 29 | 2, 28 | eqeltri 2304 | . . . . 5 ⊢ 𝐸 ∈ Word V |
| 30 | opexg 4320 | . . . . 5 ⊢ ((𝑉 ∈ Fin ∧ 𝐸 ∈ Word V) → 〈𝑉, 𝐸〉 ∈ V) | |
| 31 | 9, 29, 30 | mp2an 426 | . . . 4 ⊢ 〈𝑉, 𝐸〉 ∈ V |
| 32 | 3, 31 | eqeltri 2304 | . . 3 ⊢ 𝐺 ∈ V |
| 33 | 1, 2, 3 | konigsbergvtx 16352 | . . . . 5 ⊢ (Vtx‘𝐺) = (0...3) |
| 34 | 1, 33 | eqtr4i 2255 | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) |
| 35 | 1, 2, 3 | konigsbergiedg 16353 | . . . . 5 ⊢ (iEdg‘𝐺) = 〈“{0, 1} {0, 2} {0, 3} {1, 2} {1, 2} {2, 3} {2, 3}”〉 |
| 36 | 2, 35 | eqtr4i 2255 | . . . 4 ⊢ 𝐸 = (iEdg‘𝐺) |
| 37 | 34, 36 | wrdumgren 15976 | . . 3 ⊢ ((𝐺 ∈ V ∧ 𝐸 ∈ Word V) → (𝐺 ∈ UMGraph ↔ 𝐸 ∈ Word {𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o})) |
| 38 | 32, 29, 37 | mp2an 426 | . 2 ⊢ (𝐺 ∈ UMGraph ↔ 𝐸 ∈ Word {𝑥 ∈ 𝒫 𝑉 ∣ 𝑥 ≈ 2o}) |
| 39 | 4, 38 | mpbir 146 | 1 ⊢ 𝐺 ∈ UMGraph |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 = wceq 1397 ⊤wtru 1398 ∈ wcel 2202 {crab 2514 Vcvv 2802 𝒫 cpw 3652 {cpr 3670 〈cop 3672 class class class wbr 4088 ‘cfv 5326 (class class class)co 6018 2oc2o 6576 ≈ cen 6907 Fincfn 6909 0cc0 8032 1c1 8033 2c2 9194 3c3 9195 ℤcz 9479 ...cfz 10243 Word cword 11117 〈“cs7 11339 Vtxcvtx 15882 iEdgciedg 15883 UMGraphcumgr 15962 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-frec 6557 df-1o 6582 df-2o 6583 df-er 6702 df-en 6910 df-dom 6911 df-fin 6912 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-5 9205 df-6 9206 df-7 9207 df-8 9208 df-9 9209 df-n0 9403 df-z 9480 df-dec 9612 df-uz 9756 df-fz 10244 df-fzo 10378 df-ihash 11039 df-word 11118 df-concat 11172 df-s1 11197 df-s2 11341 df-s3 11342 df-s4 11343 df-s5 11344 df-s6 11345 df-s7 11346 df-ndx 13103 df-slot 13104 df-base 13106 df-edgf 15875 df-vtx 15884 df-iedg 15885 df-umgren 15964 |
| This theorem is referenced by: konigsberglem5 16362 konigsberg 16363 |
| Copyright terms: Public domain | W3C validator |