Theorem offval2f 6909

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	⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝑥 ∈ 𝐴 ↦ (𝐵𝑅𝐶)))

Distinct variable group:   𝑥,𝑅

Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑥)   𝐹(𝑥)   𝐺(𝑥)   𝑉(𝑥)   𝑊(𝑥)   𝑋(𝑥)

Proof of Theorem offval2f

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		offval2f.0	. . . . . 6 ⊢ Ⅎ𝑥𝜑
2		offval2f.2	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊)
3	2	ex 450	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝐵 ∈ 𝑊))
4	1, 3	ralrimi 2957	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊)
5		offval2f.a	. . . . . 6 ⊢ Ⅎ𝑥𝐴
6	5	fnmptf 6016	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
7	4, 6	syl 17	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
8		offval2f.4	. . . . 5 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵))
9	8	fneq1d 5981	. . . 4 ⊢ (𝜑 → (𝐹 Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴))
10	7, 9	mpbird 247	. . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴)
11		offval2f.3	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑋)
12	11	ex 450	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝐶 ∈ 𝑋))
13	1, 12	ralrimi 2957	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝑋)
14	5	fnmptf 6016	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝑋 → (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴)
15	13, 14	syl 17	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴)
16		offval2f.5	. . . . 5 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐴 ↦ 𝐶))
17	16	fneq1d 5981	. . . 4 ⊢ (𝜑 → (𝐺 Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴))
18	15, 17	mpbird 247	. . 3 ⊢ (𝜑 → 𝐺 Fn 𝐴)
19		offval2f.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
20		inidm 3822	. . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴
21	8	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵))
22	21	fveq1d 6193	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦))
23	16	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝐺 = (𝑥 ∈ 𝐴 ↦ 𝐶))
24	23	fveq1d 6193	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦))
25	10, 18, 19, 19, 20, 22, 24	offval 6904	. 2 ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝑦 ∈ 𝐴 ↦ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦))))
26		nfcv 2764	. . . 4 ⊢ Ⅎ𝑦𝐴
27		nffvmpt1 6199	. . . . 5 ⊢ Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)
28		nfcv 2764	. . . . 5 ⊢ Ⅎ𝑥𝑅
29		nffvmpt1 6199	. . . . 5 ⊢ Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦)
30	27, 28, 29	nfov 6676	. . . 4 ⊢ Ⅎ𝑥(((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦))
31		nfcv 2764	. . . 4 ⊢ Ⅎ𝑦(((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥))
32		fveq2 6191	. . . . 5 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
33		fveq2 6191	. . . . 5 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥))
34	32, 33	oveq12d 6668	. . . 4 ⊢ (𝑦 = 𝑥 → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦)) = (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥)))
35	26, 5, 30, 31, 34	cbvmptf 4748	. . 3 ⊢ (𝑦 ∈ 𝐴 ↦ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦))) = (𝑥 ∈ 𝐴 ↦ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥)))
36		simpr 477	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
37	5	fvmpt2f 6283	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑊) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
38	36, 2, 37	syl2anc 693	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
39	5	fvmpt2f 6283	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝑋) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶)
40	36, 11, 39	syl2anc 693	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶)
41	38, 40	oveq12d 6668	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥)) = (𝐵𝑅𝐶))
42	1, 41	mpteq2da 4743	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥))) = (𝑥 ∈ 𝐴 ↦ (𝐵𝑅𝐶)))
43	35, 42	syl5eq 2668	. 2 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↦ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦))) = (𝑥 ∈ 𝐴 ↦ (𝐵𝑅𝐶)))
44	25, 43	eqtrd 2656	1 ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝑥 ∈ 𝐴 ↦ (𝐵𝑅𝐶)))

Syntax hints:   → wi 4   ∧ wa 384   = wceq 1483  Ⅎwnf 1708   ∈ wcel 1990  Ⅎwnfc 2751  ∀wral 2912   ↦ cmpt 4729   Fn wfn 5883  ‘cfv 5888  (class class class)co 6650   ∘_𝑓 cof 6895

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-of 6897

This theorem is referenced by:  esumaddf  30123  binomcxplemnotnn0  38555