Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  hashecclwwlkn1 Structured version   Visualization version   GIF version

Theorem hashecclwwlkn1 26361
 Description: The size of every equivalence class of the equivalence relation over the set of closed walks (defined as words) with a fixed length which is a prime number is 1 or equals this length. (Contributed by Alexander van der Vekens, 17-Jun-2018.)
Hypotheses
Ref Expression
erclwwlkn.w 𝑊 = ((𝑉 ClWWalksN 𝐸)‘𝑁)
erclwwlkn.r = {⟨𝑡, 𝑢⟩ ∣ (𝑡𝑊𝑢𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑡 = (𝑢 cyclShift 𝑛))}
Assertion
Ref Expression
hashecclwwlkn1 ((𝑁 ∈ ℙ ∧ 𝑈 ∈ (𝑊 / )) → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁))
Distinct variable groups:   𝑡,𝐸,𝑢   𝑡,𝑁,𝑢   𝑛,𝑉,𝑡,𝑢   𝑡,𝑊,𝑢   𝑛,𝑁   𝑛,𝑊   𝑛,𝐸   𝑈,𝑛,𝑢
Allowed substitution hints:   (𝑢,𝑡,𝑛)   𝑈(𝑡)

Proof of Theorem hashecclwwlkn1
Dummy variables 𝑥 𝑦 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 erclwwlkn.w . . . . 5 𝑊 = ((𝑉 ClWWalksN 𝐸)‘𝑁)
2 erclwwlkn.r . . . . 5 = {⟨𝑡, 𝑢⟩ ∣ (𝑡𝑊𝑢𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑡 = (𝑢 cyclShift 𝑛))}
31, 2eclclwwlkn1 26359 . . . 4 (𝑈 ∈ (𝑊 / ) → (𝑈 ∈ (𝑊 / ) ↔ ∃𝑥𝑊 𝑈 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}))
4 rabeq 3166 . . . . . . . . . 10 (𝑊 = ((𝑉 ClWWalksN 𝐸)‘𝑁) → {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} = {𝑦 ∈ ((𝑉 ClWWalksN 𝐸)‘𝑁) ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)})
51, 4mp1i 13 . . . . . . . . 9 ((𝑁 ∈ ℙ ∧ 𝑥𝑊) → {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} = {𝑦 ∈ ((𝑉 ClWWalksN 𝐸)‘𝑁) ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)})
6 prmnn 15226 . . . . . . . . . . 11 (𝑁 ∈ ℙ → 𝑁 ∈ ℕ)
76nnnn0d 11228 . . . . . . . . . 10 (𝑁 ∈ ℙ → 𝑁 ∈ ℕ0)
81eleq2i 2680 . . . . . . . . . . 11 (𝑥𝑊𝑥 ∈ ((𝑉 ClWWalksN 𝐸)‘𝑁))
98biimpi 205 . . . . . . . . . 10 (𝑥𝑊𝑥 ∈ ((𝑉 ClWWalksN 𝐸)‘𝑁))
10 clwwlknscsh 26347 . . . . . . . . . 10 ((𝑁 ∈ ℕ0𝑥 ∈ ((𝑉 ClWWalksN 𝐸)‘𝑁)) → {𝑦 ∈ ((𝑉 ClWWalksN 𝐸)‘𝑁) ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)})
117, 9, 10syl2an 493 . . . . . . . . 9 ((𝑁 ∈ ℙ ∧ 𝑥𝑊) → {𝑦 ∈ ((𝑉 ClWWalksN 𝐸)‘𝑁) ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)})
125, 11eqtrd 2644 . . . . . . . 8 ((𝑁 ∈ ℙ ∧ 𝑥𝑊) → {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)})
1312eqeq2d 2620 . . . . . . 7 ((𝑁 ∈ ℙ ∧ 𝑥𝑊) → (𝑈 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} ↔ 𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}))
14 clwwlknprop 26300 . . . . . . . . . . . . . . 15 (𝑥 ∈ ((𝑉 ClWWalksN 𝐸)‘𝑁) → ((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ 𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)))
15 simpll 786 . . . . . . . . . . . . . . . . . 18 (((𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑁 ∈ ℕ) → 𝑥 ∈ Word 𝑉)
16 elnnne0 11183 . . . . . . . . . . . . . . . . . . . 20 (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0𝑁 ≠ 0))
17 eqeq1 2614 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (𝑁 = (#‘𝑥) → (𝑁 = 0 ↔ (#‘𝑥) = 0))
1817eqcoms 2618 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((#‘𝑥) = 𝑁 → (𝑁 = 0 ↔ (#‘𝑥) = 0))
1918adantl 481 . . . . . . . . . . . . . . . . . . . . . . . 24 ((𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁) → (𝑁 = 0 ↔ (#‘𝑥) = 0))
20 hasheq0 13015 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑥 ∈ Word 𝑉 → ((#‘𝑥) = 0 ↔ 𝑥 = ∅))
2119, 20sylan9bbr 733 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) → (𝑁 = 0 ↔ 𝑥 = ∅))
2221necon3bid 2826 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) → (𝑁 ≠ 0 ↔ 𝑥 ≠ ∅))
2322biimpcd 238 . . . . . . . . . . . . . . . . . . . . 21 (𝑁 ≠ 0 → ((𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) → 𝑥 ≠ ∅))
2423adantl 481 . . . . . . . . . . . . . . . . . . . 20 ((𝑁 ∈ ℕ0𝑁 ≠ 0) → ((𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) → 𝑥 ≠ ∅))
2516, 24sylbi 206 . . . . . . . . . . . . . . . . . . 19 (𝑁 ∈ ℕ → ((𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) → 𝑥 ≠ ∅))
2625impcom 445 . . . . . . . . . . . . . . . . . 18 (((𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑁 ∈ ℕ) → 𝑥 ≠ ∅)
27 eqcom 2617 . . . . . . . . . . . . . . . . . . . . 21 ((#‘𝑥) = 𝑁𝑁 = (#‘𝑥))
2827biimpi 205 . . . . . . . . . . . . . . . . . . . 20 ((#‘𝑥) = 𝑁𝑁 = (#‘𝑥))
2928adantl 481 . . . . . . . . . . . . . . . . . . 19 ((𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁) → 𝑁 = (#‘𝑥))
3029ad2antlr 759 . . . . . . . . . . . . . . . . . 18 (((𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑁 ∈ ℕ) → 𝑁 = (#‘𝑥))
3115, 26, 303jca 1235 . . . . . . . . . . . . . . . . 17 (((𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) ∧ 𝑁 ∈ ℕ) → (𝑥 ∈ Word 𝑉𝑥 ≠ ∅ ∧ 𝑁 = (#‘𝑥)))
3231ex 449 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) → (𝑁 ∈ ℕ → (𝑥 ∈ Word 𝑉𝑥 ≠ ∅ ∧ 𝑁 = (#‘𝑥))))
33323adant1 1072 . . . . . . . . . . . . . . 15 (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ 𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) → (𝑁 ∈ ℕ → (𝑥 ∈ Word 𝑉𝑥 ≠ ∅ ∧ 𝑁 = (#‘𝑥))))
3414, 33syl 17 . . . . . . . . . . . . . 14 (𝑥 ∈ ((𝑉 ClWWalksN 𝐸)‘𝑁) → (𝑁 ∈ ℕ → (𝑥 ∈ Word 𝑉𝑥 ≠ ∅ ∧ 𝑁 = (#‘𝑥))))
3534com12 32 . . . . . . . . . . . . 13 (𝑁 ∈ ℕ → (𝑥 ∈ ((𝑉 ClWWalksN 𝐸)‘𝑁) → (𝑥 ∈ Word 𝑉𝑥 ≠ ∅ ∧ 𝑁 = (#‘𝑥))))
368, 35syl5bi 231 . . . . . . . . . . . 12 (𝑁 ∈ ℕ → (𝑥𝑊 → (𝑥 ∈ Word 𝑉𝑥 ≠ ∅ ∧ 𝑁 = (#‘𝑥))))
376, 36syl 17 . . . . . . . . . . 11 (𝑁 ∈ ℙ → (𝑥𝑊 → (𝑥 ∈ Word 𝑉𝑥 ≠ ∅ ∧ 𝑁 = (#‘𝑥))))
3837imp 444 . . . . . . . . . 10 ((𝑁 ∈ ℙ ∧ 𝑥𝑊) → (𝑥 ∈ Word 𝑉𝑥 ≠ ∅ ∧ 𝑁 = (#‘𝑥)))
39 scshwfzeqfzo 13423 . . . . . . . . . 10 ((𝑥 ∈ Word 𝑉𝑥 ≠ ∅ ∧ 𝑁 = (#‘𝑥)) → {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)})
4038, 39syl 17 . . . . . . . . 9 ((𝑁 ∈ ℙ ∧ 𝑥𝑊) → {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)})
4140eqeq2d 2620 . . . . . . . 8 ((𝑁 ∈ ℙ ∧ 𝑥𝑊) → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} ↔ 𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)}))
42 oveq2 6557 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑛 = 𝑚 → (𝑥 cyclShift 𝑛) = (𝑥 cyclShift 𝑚))
4342eqeq2d 2620 . . . . . . . . . . . . . . . . . . . . . 22 (𝑛 = 𝑚 → (𝑦 = (𝑥 cyclShift 𝑛) ↔ 𝑦 = (𝑥 cyclShift 𝑚)))
4443cbvrexv 3148 . . . . . . . . . . . . . . . . . . . . 21 (∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛) ↔ ∃𝑚 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑚))
45 eqeq1 2614 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑦 = 𝑢 → (𝑦 = (𝑥 cyclShift 𝑚) ↔ 𝑢 = (𝑥 cyclShift 𝑚)))
46 eqcom 2617 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑢 = (𝑥 cyclShift 𝑚) ↔ (𝑥 cyclShift 𝑚) = 𝑢)
4745, 46syl6bb 275 . . . . . . . . . . . . . . . . . . . . . 22 (𝑦 = 𝑢 → (𝑦 = (𝑥 cyclShift 𝑚) ↔ (𝑥 cyclShift 𝑚) = 𝑢))
4847rexbidv 3034 . . . . . . . . . . . . . . . . . . . . 21 (𝑦 = 𝑢 → (∃𝑚 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑚) ↔ ∃𝑚 ∈ (0..^(#‘𝑥))(𝑥 cyclShift 𝑚) = 𝑢))
4944, 48syl5bb 271 . . . . . . . . . . . . . . . . . . . 20 (𝑦 = 𝑢 → (∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛) ↔ ∃𝑚 ∈ (0..^(#‘𝑥))(𝑥 cyclShift 𝑚) = 𝑢))
5049cbvrabv 3172 . . . . . . . . . . . . . . . . . . 19 {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} = {𝑢 ∈ Word 𝑉 ∣ ∃𝑚 ∈ (0..^(#‘𝑥))(𝑥 cyclShift 𝑚) = 𝑢}
5150cshwshash 15649 . . . . . . . . . . . . . . . . . 18 ((𝑥 ∈ Word 𝑉 ∧ (#‘𝑥) ∈ ℙ) → ((#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) = (#‘𝑥) ∨ (#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) = 1))
5251adantr 480 . . . . . . . . . . . . . . . . 17 (((𝑥 ∈ Word 𝑉 ∧ (#‘𝑥) ∈ ℙ) ∧ 𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) → ((#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) = (#‘𝑥) ∨ (#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) = 1))
5352orcomd 402 . . . . . . . . . . . . . . . 16 (((𝑥 ∈ Word 𝑉 ∧ (#‘𝑥) ∈ ℙ) ∧ 𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) → ((#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) = 1 ∨ (#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) = (#‘𝑥)))
54 fveq2 6103 . . . . . . . . . . . . . . . . . . 19 (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} → (#‘𝑈) = (#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}))
5554eqeq1d 2612 . . . . . . . . . . . . . . . . . 18 (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ↔ (#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) = 1))
5654eqeq1d 2612 . . . . . . . . . . . . . . . . . 18 (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = (#‘𝑥) ↔ (#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) = (#‘𝑥)))
5755, 56orbi12d 742 . . . . . . . . . . . . . . . . 17 (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} → (((#‘𝑈) = 1 ∨ (#‘𝑈) = (#‘𝑥)) ↔ ((#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) = 1 ∨ (#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) = (#‘𝑥))))
5857adantl 481 . . . . . . . . . . . . . . . 16 (((𝑥 ∈ Word 𝑉 ∧ (#‘𝑥) ∈ ℙ) ∧ 𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) → (((#‘𝑈) = 1 ∨ (#‘𝑈) = (#‘𝑥)) ↔ ((#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) = 1 ∨ (#‘{𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) = (#‘𝑥))))
5953, 58mpbird 246 . . . . . . . . . . . . . . 15 (((𝑥 ∈ Word 𝑉 ∧ (#‘𝑥) ∈ ℙ) ∧ 𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}) → ((#‘𝑈) = 1 ∨ (#‘𝑈) = (#‘𝑥)))
6059ex 449 . . . . . . . . . . . . . 14 ((𝑥 ∈ Word 𝑉 ∧ (#‘𝑥) ∈ ℙ) → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = (#‘𝑥))))
6160ex 449 . . . . . . . . . . . . 13 (𝑥 ∈ Word 𝑉 → ((#‘𝑥) ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = (#‘𝑥)))))
62613ad2ant2 1076 . . . . . . . . . . . 12 (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ 𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) → ((#‘𝑥) ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = (#‘𝑥)))))
63 eleq1 2676 . . . . . . . . . . . . . . . 16 (𝑁 = (#‘𝑥) → (𝑁 ∈ ℙ ↔ (#‘𝑥) ∈ ℙ))
64 oveq2 6557 . . . . . . . . . . . . . . . . . . . 20 (𝑁 = (#‘𝑥) → (0..^𝑁) = (0..^(#‘𝑥)))
6564rexeqdv 3122 . . . . . . . . . . . . . . . . . . 19 (𝑁 = (#‘𝑥) → (∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛) ↔ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)))
6665rabbidv 3164 . . . . . . . . . . . . . . . . . 18 (𝑁 = (#‘𝑥) → {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)} = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)})
6766eqeq2d 2620 . . . . . . . . . . . . . . . . 17 (𝑁 = (#‘𝑥) → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)} ↔ 𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)}))
68 eqeq2 2621 . . . . . . . . . . . . . . . . . 18 (𝑁 = (#‘𝑥) → ((#‘𝑈) = 𝑁 ↔ (#‘𝑈) = (#‘𝑥)))
6968orbi2d 734 . . . . . . . . . . . . . . . . 17 (𝑁 = (#‘𝑥) → (((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁) ↔ ((#‘𝑈) = 1 ∨ (#‘𝑈) = (#‘𝑥))))
7067, 69imbi12d 333 . . . . . . . . . . . . . . . 16 (𝑁 = (#‘𝑥) → ((𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁)) ↔ (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = (#‘𝑥)))))
7163, 70imbi12d 333 . . . . . . . . . . . . . . 15 (𝑁 = (#‘𝑥) → ((𝑁 ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁))) ↔ ((#‘𝑥) ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = (#‘𝑥))))))
7271eqcoms 2618 . . . . . . . . . . . . . 14 ((#‘𝑥) = 𝑁 → ((𝑁 ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁))) ↔ ((#‘𝑥) ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = (#‘𝑥))))))
7372adantl 481 . . . . . . . . . . . . 13 ((𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁) → ((𝑁 ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁))) ↔ ((#‘𝑥) ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = (#‘𝑥))))))
74733ad2ant3 1077 . . . . . . . . . . . 12 (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ 𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) → ((𝑁 ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁))) ↔ ((#‘𝑥) ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^(#‘𝑥))𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = (#‘𝑥))))))
7562, 74mpbird 246 . . . . . . . . . . 11 (((𝑉 ∈ V ∧ 𝐸 ∈ V) ∧ 𝑥 ∈ Word 𝑉 ∧ (𝑁 ∈ ℕ0 ∧ (#‘𝑥) = 𝑁)) → (𝑁 ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁))))
7614, 75syl 17 . . . . . . . . . 10 (𝑥 ∈ ((𝑉 ClWWalksN 𝐸)‘𝑁) → (𝑁 ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁))))
778, 76sylbi 206 . . . . . . . . 9 (𝑥𝑊 → (𝑁 ∈ ℙ → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁))))
7877impcom 445 . . . . . . . 8 ((𝑁 ∈ ℙ ∧ 𝑥𝑊) → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0..^𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁)))
7941, 78sylbid 229 . . . . . . 7 ((𝑁 ∈ ℙ ∧ 𝑥𝑊) → (𝑈 = {𝑦 ∈ Word 𝑉 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁)))
8013, 79sylbid 229 . . . . . 6 ((𝑁 ∈ ℙ ∧ 𝑥𝑊) → (𝑈 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁)))
8180rexlimdva 3013 . . . . 5 (𝑁 ∈ ℙ → (∃𝑥𝑊 𝑈 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁)))
8281com12 32 . . . 4 (∃𝑥𝑊 𝑈 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} → (𝑁 ∈ ℙ → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁)))
833, 82syl6bi 242 . . 3 (𝑈 ∈ (𝑊 / ) → (𝑈 ∈ (𝑊 / ) → (𝑁 ∈ ℙ → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁))))
8483pm2.43i 50 . 2 (𝑈 ∈ (𝑊 / ) → (𝑁 ∈ ℙ → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁)))
8584impcom 445 1 ((𝑁 ∈ ℙ ∧ 𝑈 ∈ (𝑊 / )) → ((#‘𝑈) = 1 ∨ (#‘𝑈) = 𝑁))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∨ wo 382   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∃wrex 2897  {crab 2900  Vcvv 3173  ∅c0 3874  {copab 4642  ‘cfv 5804  (class class class)co 6549   / cqs 7628  0cc0 9815  1c1 9816  ℕcn 10897  ℕ0cn0 11169  ...cfz 12197  ..^cfzo 12334  #chash 12979  Word cword 13146   cyclShift ccsh 13385  ℙcprime 15223   ClWWalksN cclwwlkn 26277 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-inf2 8421  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-disj 4554  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-2o 7448  df-oadd 7451  df-er 7629  df-ec 7631  df-qs 7635  df-map 7746  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-sup 8231  df-inf 8232  df-oi 8298  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-xnn0 11241  df-z 11255  df-uz 11564  df-rp 11709  df-ico 12052  df-fz 12198  df-fzo 12335  df-fl 12455  df-mod 12531  df-seq 12664  df-exp 12723  df-hash 12980  df-word 13154  df-lsw 13155  df-concat 13156  df-substr 13158  df-reps 13161  df-csh 13386  df-cj 13687  df-re 13688  df-im 13689  df-sqrt 13823  df-abs 13824  df-clim 14067  df-sum 14265  df-dvds 14822  df-gcd 15055  df-prm 15224  df-phi 15309  df-clwwlk 26279  df-clwwlkn 26280 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator