Theorem caofid1 7714

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 6704	. 2 ⊢ (𝜑 → 𝐹 Fn 𝐴)
4		caofid0.3	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
5		fnconstg 6764	. . 3 ⊢ (𝐵 ∈ 𝑊 → (𝐴 × {𝐵}) Fn 𝐴)
6	4, 5	syl 18	. 2 ⊢ (𝜑 → (𝐴 × {𝐵}) Fn 𝐴)
7		caofid1.4	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑋)
8		fnconstg 6764	. . 3 ⊢ (𝐶 ∈ 𝑋 → (𝐴 × {𝐶}) Fn 𝐴)
9	7, 8	syl 18	. 2 ⊢ (𝜑 → (𝐴 × {𝐶}) Fn 𝐴)
10		eqidd 2761	. 2 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) = (𝐹‘𝑤))
11		fvconst2g 7202	. . 3 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝑤 ∈ 𝐴) → ((𝐴 × {𝐵})‘𝑤) = 𝐵)
12	4, 11	sylan 592	. 2 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐴 × {𝐵})‘𝑤) = 𝐵)
13		caofid1.5	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥𝑅𝐵) = 𝐶)
14	13	ralrimiva 3154	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 (𝑥𝑅𝐵) = 𝐶)
15	2	ffvelcdmda 7078	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆)
16		oveq1 7421	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑅𝐵) = ((𝐹‘𝑤)𝑅𝐵))
17	16	eqeq1d 2762	. . . . 5 ⊢ (𝑥 = (𝐹‘𝑤) → ((𝑥𝑅𝐵) = 𝐶 ↔ ((𝐹‘𝑤)𝑅𝐵) = 𝐶))
18	17	rspccva 3575	. . . 4 ⊢ ((∀𝑥 ∈ 𝑆 (𝑥𝑅𝐵) = 𝐶 ∧ (𝐹‘𝑤) ∈ 𝑆) → ((𝐹‘𝑤)𝑅𝐵) = 𝐶)
19	14, 15, 18	syl2an2r 698	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑅𝐵) = 𝐶)
20		fvconst2g 7202	. . . 4 ⊢ ((𝐶 ∈ 𝑋 ∧ 𝑤 ∈ 𝐴) → ((𝐴 × {𝐶})‘𝑤) = 𝐶)
21	7, 20	sylan 592	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐴 × {𝐶})‘𝑤) = 𝐶)
22	19, 21	eqtr4d 2798	. 2 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑅𝐵) = ((𝐴 × {𝐶})‘𝑤))
23	1, 3, 6, 9, 10, 12, 22	offveq 7705	1 ⊢ (𝜑 → (𝐹 ∘f 𝑅(𝐴 × {𝐵})) = (𝐴 × {𝐶}))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  {csn 4584   × cxp 5653   Fn wfn 6528  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414   ∘_f cof 7677

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-of 7679

This theorem is used by:  plymul0or  26511  fta1lem  26540  lfl0sc  39958