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

Theorem eclclwwlkn1 26359
Description: An equivalence class according to . (Contributed by Alexander van der Vekens, 12-Apr-2018.) (Revised by Alexander van der Vekens, 15-Jun-2018.)
Hypotheses
Ref Expression
erclwwlkn.w 𝑊 = ((𝑉 ClWWalksN 𝐸)‘𝑁)
erclwwlkn.r = {⟨𝑡, 𝑢⟩ ∣ (𝑡𝑊𝑢𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑡 = (𝑢 cyclShift 𝑛))}
Assertion
Ref Expression
eclclwwlkn1 (𝐵𝑋 → (𝐵 ∈ (𝑊 / ) ↔ ∃𝑥𝑊 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}))
Distinct variable groups:   𝑡,𝐸,𝑢   𝑡,𝑁,𝑢   𝑛,𝑉,𝑡,𝑢   𝑡,𝑊,𝑢   𝑥,𝑛,𝑡,𝑢,𝑁   𝑦,𝑛,𝑡,𝑢,𝑥,𝑊   𝑥, ,𝑦   𝑥,𝑊   𝑥,𝐸   𝑥,𝑁   𝑥,𝑉   𝑥,𝑋   𝑥,𝐵,𝑦   𝑦,𝑊   𝑦,𝑋
Allowed substitution hints:   𝐵(𝑢,𝑡,𝑛)   (𝑢,𝑡,𝑛)   𝐸(𝑦,𝑛)   𝑁(𝑦)   𝑉(𝑦)   𝑋(𝑢,𝑡,𝑛)

Proof of Theorem eclclwwlkn1
StepHypRef Expression
1 elqsecl 7688 . 2 (𝐵𝑋 → (𝐵 ∈ (𝑊 / ) ↔ ∃𝑥𝑊 𝐵 = {𝑦𝑥 𝑦}))
2 erclwwlkn.w . . . . . . . . 9 𝑊 = ((𝑉 ClWWalksN 𝐸)‘𝑁)
3 erclwwlkn.r . . . . . . . . 9 = {⟨𝑡, 𝑢⟩ ∣ (𝑡𝑊𝑢𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑡 = (𝑢 cyclShift 𝑛))}
42, 3erclwwlknsym 26354 . . . . . . . 8 (𝑥 𝑦𝑦 𝑥)
52, 3erclwwlknsym 26354 . . . . . . . 8 (𝑦 𝑥𝑥 𝑦)
64, 5impbii 198 . . . . . . 7 (𝑥 𝑦𝑦 𝑥)
76a1i 11 . . . . . 6 ((𝐵𝑋𝑥𝑊) → (𝑥 𝑦𝑦 𝑥))
87abbidv 2728 . . . . 5 ((𝐵𝑋𝑥𝑊) → {𝑦𝑥 𝑦} = {𝑦𝑦 𝑥})
9 vex 3176 . . . . . . . 8 𝑦 ∈ V
10 vex 3176 . . . . . . . 8 𝑥 ∈ V
112, 3erclwwlkneq 26351 . . . . . . . 8 ((𝑦 ∈ V ∧ 𝑥 ∈ V) → (𝑦 𝑥 ↔ (𝑦𝑊𝑥𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))))
129, 10, 11mp2an 704 . . . . . . 7 (𝑦 𝑥 ↔ (𝑦𝑊𝑥𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)))
1312a1i 11 . . . . . 6 ((𝐵𝑋𝑥𝑊) → (𝑦 𝑥 ↔ (𝑦𝑊𝑥𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))))
1413abbidv 2728 . . . . 5 ((𝐵𝑋𝑥𝑊) → {𝑦𝑦 𝑥} = {𝑦 ∣ (𝑦𝑊𝑥𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))})
15 3anan12 1044 . . . . . . . 8 ((𝑦𝑊𝑥𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)) ↔ (𝑥𝑊 ∧ (𝑦𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))))
16 ibar 524 . . . . . . . . . 10 (𝑥𝑊 → ((𝑦𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)) ↔ (𝑥𝑊 ∧ (𝑦𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)))))
1716bicomd 212 . . . . . . . . 9 (𝑥𝑊 → ((𝑥𝑊 ∧ (𝑦𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))) ↔ (𝑦𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))))
1817adantl 481 . . . . . . . 8 ((𝐵𝑋𝑥𝑊) → ((𝑥𝑊 ∧ (𝑦𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))) ↔ (𝑦𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))))
1915, 18syl5bb 271 . . . . . . 7 ((𝐵𝑋𝑥𝑊) → ((𝑦𝑊𝑥𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)) ↔ (𝑦𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))))
2019abbidv 2728 . . . . . 6 ((𝐵𝑋𝑥𝑊) → {𝑦 ∣ (𝑦𝑊𝑥𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))} = {𝑦 ∣ (𝑦𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))})
21 df-rab 2905 . . . . . 6 {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)} = {𝑦 ∣ (𝑦𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))}
2220, 21syl6eqr 2662 . . . . 5 ((𝐵𝑋𝑥𝑊) → {𝑦 ∣ (𝑦𝑊𝑥𝑊 ∧ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛))} = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)})
238, 14, 223eqtrd 2648 . . . 4 ((𝐵𝑋𝑥𝑊) → {𝑦𝑥 𝑦} = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)})
2423eqeq2d 2620 . . 3 ((𝐵𝑋𝑥𝑊) → (𝐵 = {𝑦𝑥 𝑦} ↔ 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}))
2524rexbidva 3031 . 2 (𝐵𝑋 → (∃𝑥𝑊 𝐵 = {𝑦𝑥 𝑦} ↔ ∃𝑥𝑊 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}))
261, 25bitrd 267 1 (𝐵𝑋 → (𝐵 ∈ (𝑊 / ) ↔ ∃𝑥𝑊 𝐵 = {𝑦𝑊 ∣ ∃𝑛 ∈ (0...𝑁)𝑦 = (𝑥 cyclShift 𝑛)}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  {cab 2596  wrex 2897  {crab 2900  Vcvv 3173   class class class wbr 4583  {copab 4642  cfv 5804  (class class class)co 6549   / cqs 7628  0cc0 9815  ...cfz 12197   cyclShift ccsh 13385   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-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-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-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-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-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-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-card 8648  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-n0 11170  df-z 11255  df-uz 11564  df-rp 11709  df-fz 12198  df-fzo 12335  df-fl 12455  df-mod 12531  df-hash 12980  df-word 13154  df-concat 13156  df-substr 13158  df-csh 13386  df-clwwlk 26279  df-clwwlkn 26280
This theorem is referenced by:  eleclclwwlkn  26360  hashecclwwlkn1  26361  usghashecclwwlk  26362
  Copyright terms: Public domain W3C validator