Theorem caofid1 7711

Description: Transfer a right absorption law to the function operation. (Contributed by Mario Carneiro, 28-Jul-2014.)

Hypotheses

Ref	Expression
caofref.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
caofref.2	⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
caofid0.3	⊢ (𝜑 → 𝐵 ∈ 𝑊)
caofid1.4	⊢ (𝜑 → 𝐶 ∈ 𝑋)
caofid1.5	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥𝑅𝐵) = 𝐶)

Assertion

Ref	Expression
caofid1	⊢ (𝜑 → (𝐹 ∘f 𝑅(𝐴 × {𝐵})) = (𝐴 × {𝐶}))

Distinct variable groups:   𝑥,𝐵   𝑥,𝐶   𝑥,𝐹   𝜑,𝑥   𝑥,𝑅   𝑥,𝑆

Allowed substitution hints:   𝐴(𝑥)   𝑉(𝑥)   𝑊(𝑥)   𝑋(𝑥)

Proof of Theorem caofid1

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		caofref.1	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2		caofref.2	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
3	2	ffnd 6706	. 2 ⊢ (𝜑 → 𝐹 Fn 𝐴)
4		caofid0.3	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
5		fnconstg 6766	. . 3 ⊢ (𝐵 ∈ 𝑊 → (𝐴 × {𝐵}) Fn 𝐴)
6	4, 5	syl 18	. 2 ⊢ (𝜑 → (𝐴 × {𝐵}) Fn 𝐴)
7		caofid1.4	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑋)
8		fnconstg 6766	. . 3 ⊢ (𝐶 ∈ 𝑋 → (𝐴 × {𝐶}) Fn 𝐴)
9	7, 8	syl 18	. 2 ⊢ (𝜑 → (𝐴 × {𝐶}) Fn 𝐴)
10		eqidd 2763	. 2 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) = (𝐹‘𝑤))
11		fvconst2g 7200	. . 3 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝑤 ∈ 𝐴) → ((𝐴 × {𝐵})‘𝑤) = 𝐵)
12	4, 11	sylan 591	. 2 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐴 × {𝐵})‘𝑤) = 𝐵)
13		caofid1.5	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥𝑅𝐵) = 𝐶)
14	13	ralrimiva 3156	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 (𝑥𝑅𝐵) = 𝐶)
15	2	ffvelcdmda 7079	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆)
16		oveq1 7419	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑅𝐵) = ((𝐹‘𝑤)𝑅𝐵))
17	16	eqeq1d 2764	. . . . 5 ⊢ (𝑥 = (𝐹‘𝑤) → ((𝑥𝑅𝐵) = 𝐶 ↔ ((𝐹‘𝑤)𝑅𝐵) = 𝐶))
18	17	rspccva 3579	. . . 4 ⊢ ((∀𝑥 ∈ 𝑆 (𝑥𝑅𝐵) = 𝐶 ∧ (𝐹‘𝑤) ∈ 𝑆) → ((𝐹‘𝑤)𝑅𝐵) = 𝐶)
19	14, 15, 18	syl2an2r 697	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑅𝐵) = 𝐶)
20		fvconst2g 7200	. . . 4 ⊢ ((𝐶 ∈ 𝑋 ∧ 𝑤 ∈ 𝐴) → ((𝐴 × {𝐶})‘𝑤) = 𝐶)
21	7, 20	sylan 591	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐴 × {𝐶})‘𝑤) = 𝐶)
22	19, 21	eqtr4d 2800	. 2 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑅𝐵) = ((𝐴 × {𝐶})‘𝑤))
23	1, 3, 6, 9, 10, 12, 22	offveq 7702	1 ⊢ (𝜑 → (𝐹 ∘f 𝑅(𝐴 × {𝐵})) = (𝐴 × {𝐶}))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142  ∀wral 3078  {csn 4588   × cxp 5658   Fn wfn 6531  ⟶wf 6532  ‘cfv 6536  (class class class)co 7412   ∘_f cof 7674

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-of 7676

This theorem is used by:  plymul0or  26450  fta1lem  26479  lfl0sc  39884