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

Theorem shftfn 15017
Description: Functionality and domain of a sequence shifted by 𝐴. (Contributed by NM, 20-Jul-2005.) (Revised by Mario Carneiro, 3-Nov-2013.)
Hypothesis
Ref Expression
shftfval.1 𝐹 ∈ V
Assertion
Ref Expression
shftfn ((𝐹 Fn 𝐵𝐴 ∈ ℂ) → (𝐹 shift 𝐴) Fn {𝑥 ∈ ℂ ∣ (𝑥𝐴) ∈ 𝐵})
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐵

Proof of Theorem shftfn
Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relopabv 5820 . . . . 5 Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)}
21a1i 11 . . . 4 ((𝐹 Fn 𝐵𝐴 ∈ ℂ) → Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)})
3 fnfun 6647 . . . . . 6 (𝐹 Fn 𝐵 → Fun 𝐹)
43adantr 482 . . . . 5 ((𝐹 Fn 𝐵𝐴 ∈ ℂ) → Fun 𝐹)
5 funmo 6561 . . . . . . 7 (Fun 𝐹 → ∃*𝑤(𝑧𝐴)𝐹𝑤)
6 vex 3479 . . . . . . . . . 10 𝑧 ∈ V
7 vex 3479 . . . . . . . . . 10 𝑤 ∈ V
8 eleq1w 2817 . . . . . . . . . . 11 (𝑥 = 𝑧 → (𝑥 ∈ ℂ ↔ 𝑧 ∈ ℂ))
9 oveq1 7413 . . . . . . . . . . . 12 (𝑥 = 𝑧 → (𝑥𝐴) = (𝑧𝐴))
109breq1d 5158 . . . . . . . . . . 11 (𝑥 = 𝑧 → ((𝑥𝐴)𝐹𝑦 ↔ (𝑧𝐴)𝐹𝑦))
118, 10anbi12d 632 . . . . . . . . . 10 (𝑥 = 𝑧 → ((𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦) ↔ (𝑧 ∈ ℂ ∧ (𝑧𝐴)𝐹𝑦)))
12 breq2 5152 . . . . . . . . . . 11 (𝑦 = 𝑤 → ((𝑧𝐴)𝐹𝑦 ↔ (𝑧𝐴)𝐹𝑤))
1312anbi2d 630 . . . . . . . . . 10 (𝑦 = 𝑤 → ((𝑧 ∈ ℂ ∧ (𝑧𝐴)𝐹𝑦) ↔ (𝑧 ∈ ℂ ∧ (𝑧𝐴)𝐹𝑤)))
14 eqid 2733 . . . . . . . . . 10 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)}
156, 7, 11, 13, 14brab 5543 . . . . . . . . 9 (𝑧{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)}𝑤 ↔ (𝑧 ∈ ℂ ∧ (𝑧𝐴)𝐹𝑤))
1615simprbi 498 . . . . . . . 8 (𝑧{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)}𝑤 → (𝑧𝐴)𝐹𝑤)
1716moimi 2540 . . . . . . 7 (∃*𝑤(𝑧𝐴)𝐹𝑤 → ∃*𝑤 𝑧{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)}𝑤)
185, 17syl 17 . . . . . 6 (Fun 𝐹 → ∃*𝑤 𝑧{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)}𝑤)
1918alrimiv 1931 . . . . 5 (Fun 𝐹 → ∀𝑧∃*𝑤 𝑧{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)}𝑤)
204, 19syl 17 . . . 4 ((𝐹 Fn 𝐵𝐴 ∈ ℂ) → ∀𝑧∃*𝑤 𝑧{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)}𝑤)
21 dffun6 6554 . . . 4 (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)} ↔ (Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)} ∧ ∀𝑧∃*𝑤 𝑧{⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)}𝑤))
222, 20, 21sylanbrc 584 . . 3 ((𝐹 Fn 𝐵𝐴 ∈ ℂ) → Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)})
23 shftfval.1 . . . . . 6 𝐹 ∈ V
2423shftfval 15014 . . . . 5 (𝐴 ∈ ℂ → (𝐹 shift 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)})
2524adantl 483 . . . 4 ((𝐹 Fn 𝐵𝐴 ∈ ℂ) → (𝐹 shift 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)})
2625funeqd 6568 . . 3 ((𝐹 Fn 𝐵𝐴 ∈ ℂ) → (Fun (𝐹 shift 𝐴) ↔ Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)}))
2722, 26mpbird 257 . 2 ((𝐹 Fn 𝐵𝐴 ∈ ℂ) → Fun (𝐹 shift 𝐴))
2823shftdm 15015 . . 3 (𝐴 ∈ ℂ → dom (𝐹 shift 𝐴) = {𝑥 ∈ ℂ ∣ (𝑥𝐴) ∈ dom 𝐹})
29 fndm 6650 . . . . 5 (𝐹 Fn 𝐵 → dom 𝐹 = 𝐵)
3029eleq2d 2820 . . . 4 (𝐹 Fn 𝐵 → ((𝑥𝐴) ∈ dom 𝐹 ↔ (𝑥𝐴) ∈ 𝐵))
3130rabbidv 3441 . . 3 (𝐹 Fn 𝐵 → {𝑥 ∈ ℂ ∣ (𝑥𝐴) ∈ dom 𝐹} = {𝑥 ∈ ℂ ∣ (𝑥𝐴) ∈ 𝐵})
3228, 31sylan9eqr 2795 . 2 ((𝐹 Fn 𝐵𝐴 ∈ ℂ) → dom (𝐹 shift 𝐴) = {𝑥 ∈ ℂ ∣ (𝑥𝐴) ∈ 𝐵})
33 df-fn 6544 . 2 ((𝐹 shift 𝐴) Fn {𝑥 ∈ ℂ ∣ (𝑥𝐴) ∈ 𝐵} ↔ (Fun (𝐹 shift 𝐴) ∧ dom (𝐹 shift 𝐴) = {𝑥 ∈ ℂ ∣ (𝑥𝐴) ∈ 𝐵}))
3427, 32, 33sylanbrc 584 1 ((𝐹 Fn 𝐵𝐴 ∈ ℂ) → (𝐹 shift 𝐴) Fn {𝑥 ∈ ℂ ∣ (𝑥𝐴) ∈ 𝐵})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  wal 1540   = wceq 1542  wcel 2107  ∃*wmo 2533  {crab 3433  Vcvv 3475   class class class wbr 5148  {copab 5210  dom cdm 5676  Rel wrel 5681  Fun wfun 6535   Fn wfn 6536  (class class class)co 7406  cc 11105  cmin 11441   shift cshi 15010
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7722  ax-resscn 11164  ax-1cn 11165  ax-icn 11166  ax-addcl 11167  ax-addrcl 11168  ax-mulcl 11169  ax-mulrcl 11170  ax-mulcom 11171  ax-addass 11172  ax-mulass 11173  ax-distr 11174  ax-i2m1 11175  ax-1ne0 11176  ax-1rid 11177  ax-rnegex 11178  ax-rrecex 11179  ax-cnre 11180  ax-pre-lttri 11181  ax-pre-lttrn 11182  ax-pre-ltadd 11183
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-po 5588  df-so 5589  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6493  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-riota 7362  df-ov 7409  df-oprab 7410  df-mpo 7411  df-er 8700  df-en 8937  df-dom 8938  df-sdom 8939  df-pnf 11247  df-mnf 11248  df-ltxr 11250  df-sub 11443  df-shft 15011
This theorem is referenced by:  shftf  15023  seqshft  15029  uzmptshftfval  43091
  Copyright terms: Public domain W3C validator