Theorem off 5882

Description: The function operation produces a function. (Contributed by Mario Carneiro, 20-Jul-2014.)

Hypotheses

Ref	Expression
off.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑇)) → (𝑥𝑅𝑦) ∈ 𝑈)
off.2	⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
off.3	⊢ (𝜑 → 𝐺:𝐵⟶𝑇)
off.4	⊢ (𝜑 → 𝐴 ∈ 𝑉)
off.5	⊢ (𝜑 → 𝐵 ∈ 𝑊)
off.6	⊢ (𝐴 ∩ 𝐵) = 𝐶

Assertion

Ref	Expression
off	⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺):𝐶⟶𝑈)

Distinct variable groups:   𝑦,𝐺   𝑥,𝑦,𝜑   𝑥,𝑆,𝑦   𝑥,𝑇,𝑦   𝑥,𝐹,𝑦   𝑥,𝑅,𝑦   𝑥,𝑈,𝑦

Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝐺(𝑥)   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem off

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		off.2	. . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
2		off.6	. . . . . . 7 ⊢ (𝐴 ∩ 𝐵) = 𝐶
3		inss1 3221	. . . . . . 7 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴
4	2, 3	eqsstr3i 3058	. . . . . 6 ⊢ 𝐶 ⊆ 𝐴
5	4	sseli 3022	. . . . 5 ⊢ (𝑧 ∈ 𝐶 → 𝑧 ∈ 𝐴)
6		ffvelrn 5446	. . . . 5 ⊢ ((𝐹:𝐴⟶𝑆 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) ∈ 𝑆)
7	1, 5, 6	syl2an 284	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐶) → (𝐹‘𝑧) ∈ 𝑆)
8		off.3	. . . . 5 ⊢ (𝜑 → 𝐺:𝐵⟶𝑇)
9		inss2 3222	. . . . . . 7 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵
10	2, 9	eqsstr3i 3058	. . . . . 6 ⊢ 𝐶 ⊆ 𝐵
11	10	sseli 3022	. . . . 5 ⊢ (𝑧 ∈ 𝐶 → 𝑧 ∈ 𝐵)
12		ffvelrn 5446	. . . . 5 ⊢ ((𝐺:𝐵⟶𝑇 ∧ 𝑧 ∈ 𝐵) → (𝐺‘𝑧) ∈ 𝑇)
13	8, 11, 12	syl2an 284	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐶) → (𝐺‘𝑧) ∈ 𝑇)
14		off.1	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑇)) → (𝑥𝑅𝑦) ∈ 𝑈)
15	14	ralrimivva 2456	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥𝑅𝑦) ∈ 𝑈)
16	15	adantr 271	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐶) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥𝑅𝑦) ∈ 𝑈)
17		oveq1 5673	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝑧) → (𝑥𝑅𝑦) = ((𝐹‘𝑧)𝑅𝑦))
18	17	eleq1d 2157	. . . . 5 ⊢ (𝑥 = (𝐹‘𝑧) → ((𝑥𝑅𝑦) ∈ 𝑈 ↔ ((𝐹‘𝑧)𝑅𝑦) ∈ 𝑈))
19		oveq2 5674	. . . . . 6 ⊢ (𝑦 = (𝐺‘𝑧) → ((𝐹‘𝑧)𝑅𝑦) = ((𝐹‘𝑧)𝑅(𝐺‘𝑧)))
20	19	eleq1d 2157	. . . . 5 ⊢ (𝑦 = (𝐺‘𝑧) → (((𝐹‘𝑧)𝑅𝑦) ∈ 𝑈 ↔ ((𝐹‘𝑧)𝑅(𝐺‘𝑧)) ∈ 𝑈))
21	18, 20	rspc2va 2736	. . . 4 ⊢ ((((𝐹‘𝑧) ∈ 𝑆 ∧ (𝐺‘𝑧) ∈ 𝑇) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥𝑅𝑦) ∈ 𝑈) → ((𝐹‘𝑧)𝑅(𝐺‘𝑧)) ∈ 𝑈)
22	7, 13, 16, 21	syl21anc 1174	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐶) → ((𝐹‘𝑧)𝑅(𝐺‘𝑧)) ∈ 𝑈)
23		eqid 2089	. . 3 ⊢ (𝑧 ∈ 𝐶 ↦ ((𝐹‘𝑧)𝑅(𝐺‘𝑧))) = (𝑧 ∈ 𝐶 ↦ ((𝐹‘𝑧)𝑅(𝐺‘𝑧)))
24	22, 23	fmptd 5466	. 2 ⊢ (𝜑 → (𝑧 ∈ 𝐶 ↦ ((𝐹‘𝑧)𝑅(𝐺‘𝑧))):𝐶⟶𝑈)
25		ffn 5174	. . . . 5 ⊢ (𝐹:𝐴⟶𝑆 → 𝐹 Fn 𝐴)
26	1, 25	syl 14	. . . 4 ⊢ (𝜑 → 𝐹 Fn 𝐴)
27		ffn 5174	. . . . 5 ⊢ (𝐺:𝐵⟶𝑇 → 𝐺 Fn 𝐵)
28	8, 27	syl 14	. . . 4 ⊢ (𝜑 → 𝐺 Fn 𝐵)
29		off.4	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
30		off.5	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
31		eqidd 2090	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) = (𝐹‘𝑧))
32		eqidd 2090	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐵) → (𝐺‘𝑧) = (𝐺‘𝑧))
33	26, 28, 29, 30, 2, 31, 32	offval 5877	. . 3 ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝑧 ∈ 𝐶 ↦ ((𝐹‘𝑧)𝑅(𝐺‘𝑧))))
34	33	feq1d 5162	. 2 ⊢ (𝜑 → ((𝐹 ∘𝑓 𝑅𝐺):𝐶⟶𝑈 ↔ (𝑧 ∈ 𝐶 ↦ ((𝐹‘𝑧)𝑅(𝐺‘𝑧))):𝐶⟶𝑈))
35	24, 34	mpbird 166	1 ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺):𝐶⟶𝑈)

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1290   ∈ wcel 1439  ∀wral 2360   ∩ cin 2999   ↦ cmpt 3905   Fn wfn 5023  ⟶wf 5024  ‘cfv 5028  (class class class)co 5666   ∘_𝑓 cof 5868

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-coll 3960  ax-sep 3963  ax-pow 4015  ax-pr 4045  ax-setind 4366

This theorem depends on definitions:  df-bi 116  df-3an 927  df-tru 1293  df-fal 1296  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ne 2257  df-ral 2365  df-rex 2366  df-reu 2367  df-rab 2369  df-v 2622  df-sbc 2842  df-csb 2935  df-dif 3002  df-un 3004  df-in 3006  df-ss 3013  df-pw 3435  df-sn 3456  df-pr 3457  df-op 3459  df-uni 3660  df-iun 3738  df-br 3852  df-opab 3906  df-mpt 3907  df-id 4129  df-xp 4458  df-rel 4459  df-cnv 4460  df-co 4461  df-dm 4462  df-rn 4463  df-res 4464  df-ima 4465  df-iota 4993  df-fun 5030  df-fn 5031  df-f 5032  df-f1 5033  df-fo 5034  df-f1o 5035  df-fv 5036  df-ov 5669  df-oprab 5670  df-mpt2 5671  df-of 5870

This theorem is referenced by: (None)