| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > gpgcubic | Structured version Visualization version GIF version | ||
| Description: Every generalized Petersen graph is a cubic graph, i.e., it is a 3-regular graph, i.e., every vertex has degree 3 (see gpgvtxdg3 49514), i.e., every vertex has exactly three (different) neighbors. (Contributed by AV, 3-Sep-2025.) |
| Ref | Expression |
|---|---|
| gpgnbgr.j | ⊢ 𝐽 = (1..^(⌈‘(𝑁 / 2))) |
| gpgnbgr.g | ⊢ 𝐺 = (𝑁 gPetersenGr 𝐾) |
| gpgnbgr.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| gpgnbgr.u | ⊢ 𝑈 = (𝐺 NeighbVtx 𝑋) |
| Ref | Expression |
|---|---|
| gpgcubic | ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (♯‘𝑈) = 3) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . . 4 ⊢ (0..^𝑁) = (0..^𝑁) | |
| 2 | gpgnbgr.j | . . . 4 ⊢ 𝐽 = (1..^(⌈‘(𝑁 / 2))) | |
| 3 | gpgnbgr.g | . . . 4 ⊢ 𝐺 = (𝑁 gPetersenGr 𝐾) | |
| 4 | gpgnbgr.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 5 | 1, 2, 3, 4 | gpgvtxel 49479 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) → (𝑋 ∈ 𝑉 ↔ ∃𝑥 ∈ {0, 1}∃𝑦 ∈ (0..^𝑁)𝑋 = 〈𝑥, 𝑦〉)) |
| 6 | 5 | biimp3a 1499 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → ∃𝑥 ∈ {0, 1}∃𝑦 ∈ (0..^𝑁)𝑋 = 〈𝑥, 𝑦〉) |
| 7 | elpri 4608 | . . . . . . 7 ⊢ (𝑥 ∈ {0, 1} → (𝑥 = 0 ∨ 𝑥 = 1)) | |
| 8 | opeq1 4845 | . . . . . . . . . . . 12 ⊢ (𝑥 = 0 → 〈𝑥, 𝑦〉 = 〈0, 𝑦〉) | |
| 9 | 8 | eqeq2d 2774 | . . . . . . . . . . 11 ⊢ (𝑥 = 0 → (𝑋 = 〈𝑥, 𝑦〉 ↔ 𝑋 = 〈0, 𝑦〉)) |
| 10 | 9 | adantr 486 | . . . . . . . . . 10 ⊢ ((𝑥 = 0 ∧ (𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉)) → (𝑋 = 〈𝑥, 𝑦〉 ↔ 𝑋 = 〈0, 𝑦〉)) |
| 11 | c0ex 11339 | . . . . . . . . . . . . 13 ⊢ 0 ∈ V | |
| 12 | vex 3458 | . . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V | |
| 13 | 11, 12 | op1std 8045 | . . . . . . . . . . . 12 ⊢ (𝑋 = 〈0, 𝑦〉 → (1st ‘𝑋) = 0) |
| 14 | gpgnbgr.u | . . . . . . . . . . . . . . 15 ⊢ 𝑈 = (𝐺 NeighbVtx 𝑋) | |
| 15 | 2, 3, 4, 14 | gpg3nbgrvtx0 49508 | . . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 0)) → (♯‘𝑈) = 3) |
| 16 | 15 | exp43 442 | . . . . . . . . . . . . 13 ⊢ (𝑁 ∈ (ℤ≥‘3) → (𝐾 ∈ 𝐽 → (𝑋 ∈ 𝑉 → ((1st ‘𝑋) = 0 → (♯‘𝑈) = 3)))) |
| 17 | 16 | 3imp 1128 | . . . . . . . . . . . 12 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → ((1st ‘𝑋) = 0 → (♯‘𝑈) = 3)) |
| 18 | 13, 17 | syl5 35 | . . . . . . . . . . 11 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (𝑋 = 〈0, 𝑦〉 → (♯‘𝑈) = 3)) |
| 19 | 18 | adantl 487 | . . . . . . . . . 10 ⊢ ((𝑥 = 0 ∧ (𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉)) → (𝑋 = 〈0, 𝑦〉 → (♯‘𝑈) = 3)) |
| 20 | 10, 19 | sylbid 243 | . . . . . . . . 9 ⊢ ((𝑥 = 0 ∧ (𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉)) → (𝑋 = 〈𝑥, 𝑦〉 → (♯‘𝑈) = 3)) |
| 21 | 20 | ex 418 | . . . . . . . 8 ⊢ (𝑥 = 0 → ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (𝑋 = 〈𝑥, 𝑦〉 → (♯‘𝑈) = 3))) |
| 22 | opeq1 4845 | . . . . . . . . . . . 12 ⊢ (𝑥 = 1 → 〈𝑥, 𝑦〉 = 〈1, 𝑦〉) | |
| 23 | 22 | eqeq2d 2774 | . . . . . . . . . . 11 ⊢ (𝑥 = 1 → (𝑋 = 〈𝑥, 𝑦〉 ↔ 𝑋 = 〈1, 𝑦〉)) |
| 24 | 23 | adantr 486 | . . . . . . . . . 10 ⊢ ((𝑥 = 1 ∧ (𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉)) → (𝑋 = 〈𝑥, 𝑦〉 ↔ 𝑋 = 〈1, 𝑦〉)) |
| 25 | 1ex 11342 | . . . . . . . . . . . . 13 ⊢ 1 ∈ V | |
| 26 | 25, 12 | op1std 8045 | . . . . . . . . . . . 12 ⊢ (𝑋 = 〈1, 𝑦〉 → (1st ‘𝑋) = 1) |
| 27 | 2, 3, 4, 14 | gpg3nbgrvtx1 49510 | . . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → (♯‘𝑈) = 3) |
| 28 | 27 | exp43 442 | . . . . . . . . . . . . 13 ⊢ (𝑁 ∈ (ℤ≥‘3) → (𝐾 ∈ 𝐽 → (𝑋 ∈ 𝑉 → ((1st ‘𝑋) = 1 → (♯‘𝑈) = 3)))) |
| 29 | 28 | 3imp 1128 | . . . . . . . . . . . 12 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → ((1st ‘𝑋) = 1 → (♯‘𝑈) = 3)) |
| 30 | 26, 29 | syl5 35 | . . . . . . . . . . 11 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (𝑋 = 〈1, 𝑦〉 → (♯‘𝑈) = 3)) |
| 31 | 30 | adantl 487 | . . . . . . . . . 10 ⊢ ((𝑥 = 1 ∧ (𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉)) → (𝑋 = 〈1, 𝑦〉 → (♯‘𝑈) = 3)) |
| 32 | 24, 31 | sylbid 243 | . . . . . . . . 9 ⊢ ((𝑥 = 1 ∧ (𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉)) → (𝑋 = 〈𝑥, 𝑦〉 → (♯‘𝑈) = 3)) |
| 33 | 32 | ex 418 | . . . . . . . 8 ⊢ (𝑥 = 1 → ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (𝑋 = 〈𝑥, 𝑦〉 → (♯‘𝑈) = 3))) |
| 34 | 21, 33 | jaoi 871 | . . . . . . 7 ⊢ ((𝑥 = 0 ∨ 𝑥 = 1) → ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (𝑋 = 〈𝑥, 𝑦〉 → (♯‘𝑈) = 3))) |
| 35 | 7, 34 | syl 18 | . . . . . 6 ⊢ (𝑥 ∈ {0, 1} → ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (𝑋 = 〈𝑥, 𝑦〉 → (♯‘𝑈) = 3))) |
| 36 | 35 | impcom 413 | . . . . 5 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) ∧ 𝑥 ∈ {0, 1}) → (𝑋 = 〈𝑥, 𝑦〉 → (♯‘𝑈) = 3)) |
| 37 | 36 | a1d 26 | . . . 4 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) ∧ 𝑥 ∈ {0, 1}) → (𝑦 ∈ (0..^𝑁) → (𝑋 = 〈𝑥, 𝑦〉 → (♯‘𝑈) = 3))) |
| 38 | 37 | expimpd 459 | . . 3 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → ((𝑥 ∈ {0, 1} ∧ 𝑦 ∈ (0..^𝑁)) → (𝑋 = 〈𝑥, 𝑦〉 → (♯‘𝑈) = 3))) |
| 39 | 38 | rexlimdvv 3222 | . 2 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (∃𝑥 ∈ {0, 1}∃𝑦 ∈ (0..^𝑁)𝑋 = 〈𝑥, 𝑦〉 → (♯‘𝑈) = 3)) |
| 40 | 6, 39 | mpd 16 | 1 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (♯‘𝑈) = 3) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 {cpr 4590 〈cop 4840 ‘cfv 6566 (class class class)co 7451 1st c1st 8033 0cc0 11239 1c1 11240 / cdiv 12013 2c2 12437 3c3 12438 ℤ≥cuz 13005 ..^cfzo 13828 ⌈cceil 13971 ♯chash 14515 Vtxcvtx 29631 NeighbVtx cnbgr 29970 gPetersenGr cgpg 49472 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-2o 8515 df-oadd 8518 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-inf 9472 df-dju 10019 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-xnn0 12720 df-z 12734 df-dec 12855 df-uz 13006 df-rp 13161 df-ico 13522 df-fz 13680 df-fzo 13829 df-fl 13972 df-ceil 13973 df-mod 14050 df-hash 14516 df-dvds 16467 df-struct 17369 df-slot 17404 df-ndx 17416 df-base 17432 df-edgf 29624 df-vtx 29633 df-iedg 29634 df-edg 29683 df-upgr 29717 df-umgr 29718 df-usgr 29789 df-nbgr 29971 df-gpg 49473 |
| This theorem is used by: gpgvtxdg3 49514 |
| Copyright terms: Public domain | W3C validator |