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

Theorem offval2f 7740
Description: The function operation expressed as a mapping. (Contributed by Thierry Arnoux, 23-Jun-2017.)
Hypotheses
Ref Expression
offval2f.0 Ⅎ𝑥𝜑
offval2f.a Ⅎ𝑥𝐴
offval2f.1 (𝜑 → 𝐴 ∈ 𝑉)
offval2f.2 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊)
offval2f.3 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑋)
offval2f.4 (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵))
offval2f.5 (𝜑 → 𝐺 = (𝑥 ∈ 𝐴 ↦ 𝐶))
Assertion
Ref Expression
offval2f (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ 𝐴 ↦ (𝐵𝑅𝐶)))
Distinct variable group:   𝑥,𝑅
Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑥)   𝐹(𝑥)   𝐺(𝑥)   𝑉(𝑥)   𝑊(𝑥)   𝑋(𝑥)

Proof of Theorem offval2f
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 offval2f.0 . . . . . 6 Ⅎ𝑥𝜑
2 offval2f.2 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊)
32ex 418 . . . . . 6 (𝜑 → (𝑥 ∈ 𝐴 → 𝐵 ∈ 𝑊))
41, 3ralrimi 3264 . . . . 5 (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊)
5 offval2f.a . . . . . 6 Ⅎ𝑥𝐴
65fnmptf 6705 . . . . 5 (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
74, 6syl 18 . . . 4 (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
8 offval2f.4 . . . . 5 (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵))
98fneq1d 6662 . . . 4 (𝜑 → (𝐹 Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴))
107, 9mpbird 260 . . 3 (𝜑 → 𝐹 Fn 𝐴)
11 offval2f.3 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑋)
1211ex 418 . . . . . 6 (𝜑 → (𝑥 ∈ 𝐴 → 𝐶 ∈ 𝑋))
131, 12ralrimi 3264 . . . . 5 (𝜑 → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝑋)
145fnmptf 6705 . . . . 5 (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝑋 → (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴)
1513, 14syl 18 . . . 4 (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴)
16 offval2f.5 . . . . 5 (𝜑 → 𝐺 = (𝑥 ∈ 𝐴 ↦ 𝐶))
1716fneq1d 6662 . . . 4 (𝜑 → (𝐺 Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴))
1815, 17mpbird 260 . . 3 (𝜑 → 𝐺 Fn 𝐴)
19 offval2f.1 . . 3 (𝜑 → 𝐴 ∈ 𝑉)
20 inidm 4126 . . 3 (𝐴 ∩ 𝐴) = 𝐴
218adantr 486 . . . 4 ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵))
2221fveq1d 6918 . . 3 ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦))
2316adantr 486 . . . 4 ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝐺 = (𝑥 ∈ 𝐴 ↦ 𝐶))
2423fveq1d 6918 . . 3 ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦))
2510, 18, 19, 19, 20, 22, 24offval 7734 . 2 (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑦 ∈ 𝐴 ↦ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦))))
26 nfcv 2926 . . . 4 Ⅎ𝑦𝐴
27 nffvmpt1 6927 . . . . 5 Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)
28 nfcv 2926 . . . . 5 Ⅎ𝑥𝑅
29 nffvmpt1 6927 . . . . 5 Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦)
3027, 28, 29nfov 7481 . . . 4 Ⅎ𝑥(((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦))
31 nfcv 2926 . . . 4 Ⅎ𝑦(((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥))
32 fveq2 6916 . . . . 5 (𝑦 = 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
33 fveq2 6916 . . . . 5 (𝑦 = 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥))
3432, 33oveq12d 7469 . . . 4 (𝑦 = 𝑥 → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦)) = (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥)))
3526, 5, 30, 31, 34cbvmptf 5211 . . 3 (𝑦 ∈ 𝐴 ↦ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦))) = (𝑥 ∈ 𝐴 ↦ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥)))
36 simpr 490 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
375fvmpt2f 7025 . . . . . 6 ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑊) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
3836, 2, 37syl2anc 596 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
395fvmpt2f 7025 . . . . . 6 ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝑋) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶)
4036, 11, 39syl2anc 596 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶)
4138, 40oveq12d 7469 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥)) = (𝐵𝑅𝐶))
421, 41mpteq2da 5203 . . 3 (𝜑 → (𝑥 ∈ 𝐴 ↦ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥))) = (𝑥 ∈ 𝐴 ↦ (𝐵𝑅𝐶)))
4335, 42eqtrid 2810 . 2 (𝜑 → (𝑦 ∈ 𝐴 ↦ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦))) = (𝑥 ∈ 𝐴 ↦ (𝐵𝑅𝐶)))
4425, 43eqtrd 2798 1 (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ 𝐴 ↦ (𝐵𝑅𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2147  Ⅎwnfc 2911  ∀wral 3080   ↦ cmpt 5192   Fn wfn 6561  ‘cfv 6566  (class class class)co 7451   ∘f cof 7723
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-of 7725
This theorem is used by:  esumaddf  34804  binomcxplemnotnn0  45601
  Copyright terms: Public domain W3C validator