Theorem ofrfval2 7701

Description: The function relation acting on maps. (Contributed by Mario Carneiro, 20-Jul-2014.)

Hypotheses

Ref	Expression
offval2.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
offval2.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊)
offval2.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑋)
offval2.4	⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵))
offval2.5	⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐴 ↦ 𝐶))

Assertion

Ref	Expression
ofrfval2	⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑥 ∈ 𝐴 𝐵𝑅𝐶))

Distinct variable groups:   𝑥,𝐴   𝜑,𝑥   𝑥,𝑅

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

Proof of Theorem ofrfval2

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		offval2.2	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊)
2	1	ralrimiva 3159	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊)
3		eqid 2765	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
4	3	fnmpt 6679	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ 𝑊 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
5	2, 4	syl 18	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
6		offval2.4	. . . . 5 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵))
7	6	fneq1d 6632	. . . 4 ⊢ (𝜑 → (𝐹 Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴))
8	5, 7	mpbird 260	. . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴)
9		offval2.3	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑋)
10	9	ralrimiva 3159	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝑋)
11		eqid 2765	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐴 ↦ 𝐶)
12	11	fnmpt 6679	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝑋 → (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴)
13	10, 12	syl 18	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴)
14		offval2.5	. . . . 5 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐴 ↦ 𝐶))
15	14	fneq1d 6632	. . . 4 ⊢ (𝜑 → (𝐺 Fn 𝐴 ↔ (𝑥 ∈ 𝐴 ↦ 𝐶) Fn 𝐴))
16	13, 15	mpbird 260	. . 3 ⊢ (𝜑 → 𝐺 Fn 𝐴)
17		offval2.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
18		inidm 4179	. . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴
19	6	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵))
20	19	fveq1d 6887	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦))
21	14	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → 𝐺 = (𝑥 ∈ 𝐴 ↦ 𝐶))
22	21	fveq1d 6887	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → (𝐺‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦))
23	8, 16, 17, 17, 18, 20, 22	ofrfval 7690	. 2 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦)))
24		nffvmpt1 6896	. . . . 5 ⊢ Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)
25		nfcv 2927	. . . . 5 ⊢ Ⅎ𝑥𝑅
26		nffvmpt1 6896	. . . . 5 ⊢ Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦)
27	24, 25, 26	nfbr 5160	. . . 4 ⊢ Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦)
28		nfv 1947	. . . 4 ⊢ Ⅎ𝑦((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥)
29		fveq2 6885	. . . . 5 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
30		fveq2 6885	. . . . 5 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥))
31	29, 30	breq12d 5124	. . . 4 ⊢ (𝑦 = 𝑥 → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦) ↔ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥)))
32	27, 28, 31	cbvralw 3309	. . 3 ⊢ (∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦) ↔ ∀𝑥 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥))
33		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
34	3	fvmpt2 7005	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑊) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
35	33, 1, 34	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
36	11	fvmpt2 7005	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝑋) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶)
37	33, 9, 36	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) = 𝐶)
38	35, 37	breq12d 5124	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) ↔ 𝐵𝑅𝐶))
39	38	ralbidva 3188	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑥) ↔ ∀𝑥 ∈ 𝐴 𝐵𝑅𝐶))
40	32, 39	bitrid 286	. 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)𝑅((𝑥 ∈ 𝐴 ↦ 𝐶)‘𝑦) ↔ ∀𝑥 ∈ 𝐴 𝐵𝑅𝐶))
41	23, 40	bitrd 282	1 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑥 ∈ 𝐴 𝐵𝑅𝐶))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081   class class class wbr 5111   ↦ cmpt 5194   Fn wfn 6535  ‘cfv 6540   ∘_r cofr 7679

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ofr 7681

This theorem is used by:  gsumbagdiaglem  22111  mplmonmul  22217  coe1mul2lem1  22458  itg2const  25930  itg2const2  25931  itg2uba  25933  itg2mulclem  25936  itg2splitlem  25938  itg2split  25939  itg2monolem1  25940  itg2gt0  25950  itg2cnlem1  25951  itg2cnlem2  25952  iblss  25995  i1fibl  25998  itgitg1  25999  itgle  26000  ibladdlem  26010  iblabs  26019  iblabsr  26020  iblmulc2  26021  bddmulibl  26029  bddiblnc  26032  mplmulmvr  33969  psrmonmul  33980  itg2addnclem  38355  itg2addnclem3  38357  itg2addnc  38358  itg2gt0cn  38359  ibladdnclem  38360  iblabsnc  38368  iblmulc2nc  38369  ftc1anclem4  38380  ftc1anclem5  38381  ftc1anclem6  38382  ftc1anclem7  38383  ftc1anclem8  38384  ftc1anc  38385