ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  shftdm GIF version

Theorem shftdm 11075
Description: Domain of a relation shifted by 𝐴. The set on the right is more commonly notated as (dom 𝐹 + 𝐴) (meaning add 𝐴 to every element of dom 𝐹). (Contributed by Mario Carneiro, 3-Nov-2013.)
Hypothesis
Ref Expression
shftfval.1 𝐹 ∈ V
Assertion
Ref Expression
shftdm (𝐴 ∈ ℂ → dom (𝐹 shift 𝐴) = {𝑥 ∈ ℂ ∣ (𝑥𝐴) ∈ dom 𝐹})
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Proof of Theorem shftdm
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 shftfval.1 . . . 4 𝐹 ∈ V
21shftfval 11074 . . 3 (𝐴 ∈ ℂ → (𝐹 shift 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)})
32dmeqd 4879 . 2 (𝐴 ∈ ℂ → dom (𝐹 shift 𝐴) = dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)})
4 19.42v 1929 . . . . 5 (∃𝑦(𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦) ↔ (𝑥 ∈ ℂ ∧ ∃𝑦(𝑥𝐴)𝐹𝑦))
5 simpr 110 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → 𝑥 ∈ ℂ)
6 simpl 109 . . . . . . . 8 ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → 𝐴 ∈ ℂ)
75, 6subcld 8382 . . . . . . 7 ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → (𝑥𝐴) ∈ ℂ)
8 eldmg 4872 . . . . . . 7 ((𝑥𝐴) ∈ ℂ → ((𝑥𝐴) ∈ dom 𝐹 ↔ ∃𝑦(𝑥𝐴)𝐹𝑦))
97, 8syl 14 . . . . . 6 ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℂ) → ((𝑥𝐴) ∈ dom 𝐹 ↔ ∃𝑦(𝑥𝐴)𝐹𝑦))
109pm5.32da 452 . . . . 5 (𝐴 ∈ ℂ → ((𝑥 ∈ ℂ ∧ (𝑥𝐴) ∈ dom 𝐹) ↔ (𝑥 ∈ ℂ ∧ ∃𝑦(𝑥𝐴)𝐹𝑦)))
114, 10bitr4id 199 . . . 4 (𝐴 ∈ ℂ → (∃𝑦(𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦) ↔ (𝑥 ∈ ℂ ∧ (𝑥𝐴) ∈ dom 𝐹)))
1211abbidv 2322 . . 3 (𝐴 ∈ ℂ → {𝑥 ∣ ∃𝑦(𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)} = {𝑥 ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴) ∈ dom 𝐹)})
13 dmopab 4888 . . 3 dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)} = {𝑥 ∣ ∃𝑦(𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)}
14 df-rab 2492 . . 3 {𝑥 ∈ ℂ ∣ (𝑥𝐴) ∈ dom 𝐹} = {𝑥 ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴) ∈ dom 𝐹)}
1512, 13, 143eqtr4g 2262 . 2 (𝐴 ∈ ℂ → dom {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ℂ ∧ (𝑥𝐴)𝐹𝑦)} = {𝑥 ∈ ℂ ∣ (𝑥𝐴) ∈ dom 𝐹})
163, 15eqtrd 2237 1 (𝐴 ∈ ℂ → dom (𝐹 shift 𝐴) = {𝑥 ∈ ℂ ∣ (𝑥𝐴) ∈ dom 𝐹})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1372  wex 1514  wcel 2175  {cab 2190  {crab 2487  Vcvv 2771   class class class wbr 4043  {copab 4103  dom cdm 4674  (class class class)co 5943  cc 7922  cmin 8242   shift cshi 11067
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-coll 4158  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-resscn 8016  ax-1cn 8017  ax-icn 8019  ax-addcl 8020  ax-addrcl 8021  ax-mulcl 8022  ax-addcom 8024  ax-addass 8026  ax-distr 8028  ax-i2m1 8029  ax-0id 8032  ax-rnegex 8033  ax-cnre 8035
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-ral 2488  df-rex 2489  df-reu 2490  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-f1 5275  df-fo 5276  df-f1o 5277  df-fv 5278  df-riota 5898  df-ov 5946  df-oprab 5947  df-mpo 5948  df-sub 8244  df-shft 11068
This theorem is referenced by:  shftfn  11077
  Copyright terms: Public domain W3C validator