| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > numclwwlk5lem | Structured version Visualization version GIF version | ||
| Description: Lemma for numclwwlk5 30473. (Contributed by Alexander van der Vekens, 7-Oct-2018.) (Revised by AV, 2-Jun-2021.) (Revised by AV, 7-Mar-2022.) |
| Ref | Expression |
|---|---|
| numclwwlk3.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| numclwwlk5lem | ⊢ ((𝐺 RegUSGraph 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0) → (2 ∥ (𝐾 − 1) → ((♯‘(𝑋(ClWWalksNOn‘𝐺)2)) mod 2) = 1)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | numclwwlk3.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | 1 | eleq2i 2829 | . . . 4 ⊢ (𝑋 ∈ 𝑉 ↔ 𝑋 ∈ (Vtx‘𝐺)) |
| 3 | clwwlknon2num 30190 | . . . 4 ⊢ ((𝐺 RegUSGraph 𝐾 ∧ 𝑋 ∈ (Vtx‘𝐺)) → (♯‘(𝑋(ClWWalksNOn‘𝐺)2)) = 𝐾) | |
| 4 | 2, 3 | sylan2b 595 | . . 3 ⊢ ((𝐺 RegUSGraph 𝐾 ∧ 𝑋 ∈ 𝑉) → (♯‘(𝑋(ClWWalksNOn‘𝐺)2)) = 𝐾) |
| 5 | 4 | 3adant3 1133 | . 2 ⊢ ((𝐺 RegUSGraph 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0) → (♯‘(𝑋(ClWWalksNOn‘𝐺)2)) = 𝐾) |
| 6 | oveq1 7367 | . . . . 5 ⊢ ((♯‘(𝑋(ClWWalksNOn‘𝐺)2)) = 𝐾 → ((♯‘(𝑋(ClWWalksNOn‘𝐺)2)) mod 2) = (𝐾 mod 2)) | |
| 7 | 6 | ad2antrr 727 | . . . 4 ⊢ ((((♯‘(𝑋(ClWWalksNOn‘𝐺)2)) = 𝐾 ∧ (𝐺 RegUSGraph 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0)) ∧ 2 ∥ (𝐾 − 1)) → ((♯‘(𝑋(ClWWalksNOn‘𝐺)2)) mod 2) = (𝐾 mod 2)) |
| 8 | 2prm 16652 | . . . . . . . . 9 ⊢ 2 ∈ ℙ | |
| 9 | nn0z 12539 | . . . . . . . . 9 ⊢ (𝐾 ∈ ℕ0 → 𝐾 ∈ ℤ) | |
| 10 | modprm1div 16759 | . . . . . . . . 9 ⊢ ((2 ∈ ℙ ∧ 𝐾 ∈ ℤ) → ((𝐾 mod 2) = 1 ↔ 2 ∥ (𝐾 − 1))) | |
| 11 | 8, 9, 10 | sylancr 588 | . . . . . . . 8 ⊢ (𝐾 ∈ ℕ0 → ((𝐾 mod 2) = 1 ↔ 2 ∥ (𝐾 − 1))) |
| 12 | 11 | biimprd 248 | . . . . . . 7 ⊢ (𝐾 ∈ ℕ0 → (2 ∥ (𝐾 − 1) → (𝐾 mod 2) = 1)) |
| 13 | 12 | 3ad2ant3 1136 | . . . . . 6 ⊢ ((𝐺 RegUSGraph 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0) → (2 ∥ (𝐾 − 1) → (𝐾 mod 2) = 1)) |
| 14 | 13 | adantl 481 | . . . . 5 ⊢ (((♯‘(𝑋(ClWWalksNOn‘𝐺)2)) = 𝐾 ∧ (𝐺 RegUSGraph 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0)) → (2 ∥ (𝐾 − 1) → (𝐾 mod 2) = 1)) |
| 15 | 14 | imp 406 | . . . 4 ⊢ ((((♯‘(𝑋(ClWWalksNOn‘𝐺)2)) = 𝐾 ∧ (𝐺 RegUSGraph 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0)) ∧ 2 ∥ (𝐾 − 1)) → (𝐾 mod 2) = 1) |
| 16 | 7, 15 | eqtrd 2772 | . . 3 ⊢ ((((♯‘(𝑋(ClWWalksNOn‘𝐺)2)) = 𝐾 ∧ (𝐺 RegUSGraph 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0)) ∧ 2 ∥ (𝐾 − 1)) → ((♯‘(𝑋(ClWWalksNOn‘𝐺)2)) mod 2) = 1) |
| 17 | 16 | ex 412 | . 2 ⊢ (((♯‘(𝑋(ClWWalksNOn‘𝐺)2)) = 𝐾 ∧ (𝐺 RegUSGraph 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0)) → (2 ∥ (𝐾 − 1) → ((♯‘(𝑋(ClWWalksNOn‘𝐺)2)) mod 2) = 1)) |
| 18 | 5, 17 | mpancom 689 | 1 ⊢ ((𝐺 RegUSGraph 𝐾 ∧ 𝑋 ∈ 𝑉 ∧ 𝐾 ∈ ℕ0) → (2 ∥ (𝐾 − 1) → ((♯‘(𝑋(ClWWalksNOn‘𝐺)2)) mod 2) = 1)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5086 ‘cfv 6492 (class class class)co 7360 1c1 11030 − cmin 11368 2c2 12227 ℕ0cn0 12428 ℤcz 12515 mod cmo 13819 ♯chash 14283 ∥ cdvds 16212 ℙcprime 16631 Vtxcvtx 29079 RegUSGraph crusgr 29640 ClWWalksNOncclwwlknon 30172 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-2o 8399 df-oadd 8402 df-er 8636 df-map 8768 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-sup 9348 df-inf 9349 df-dju 9816 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-n0 12429 df-xnn0 12502 df-z 12516 df-uz 12780 df-rp 12934 df-xadd 13055 df-fz 13453 df-fzo 13600 df-fl 13742 df-mod 13820 df-seq 13955 df-exp 14015 df-hash 14284 df-word 14467 df-lsw 14516 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-dvds 16213 df-prm 16632 df-edg 29131 df-uhgr 29141 df-ushgr 29142 df-upgr 29165 df-umgr 29166 df-uspgr 29233 df-usgr 29234 df-nbgr 29416 df-vtxdg 29550 df-rgr 29641 df-rusgr 29642 df-clwwlk 30067 df-clwwlkn 30110 df-clwwlknon 30173 |
| This theorem is referenced by: numclwwlk5 30473 |
| Copyright terms: Public domain | W3C validator |