Theorem ofrn2 33113

Description: The range of the function operation. (Contributed by Thierry Arnoux, 21-Mar-2017.)

Hypotheses

Ref	Expression
ofrn.1	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
ofrn.2	⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
ofrn.3	⊢ (𝜑 → + :(𝐵 × 𝐵)⟶𝐶)
ofrn.4	⊢ (𝜑 → 𝐴 ∈ 𝑉)

Assertion

Ref	Expression
ofrn2	⊢ (𝜑 → ran (𝐹 ∘f + 𝐺) ⊆ ( + “ (ran 𝐹 × ran 𝐺)))

Proof of Theorem ofrn2

Dummy variables 𝑥 𝑦 𝑧 𝑎 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ofrn.1	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
2	1	ffnd 6703	. . . . . 6 ⊢ (𝜑 → 𝐹 Fn 𝐴)
3		simprl 783	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → 𝑎 ∈ 𝐴)
4		fnfvelrn 7073	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) ∈ ran 𝐹)
5	2, 3, 4	syl2an2r 698	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → (𝐹‘𝑎) ∈ ran 𝐹)
6		ofrn.2	. . . . . . 7 ⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
7	6	ffnd 6703	. . . . . 6 ⊢ (𝜑 → 𝐺 Fn 𝐴)
8		fnfvelrn 7073	. . . . . 6 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑎 ∈ 𝐴) → (𝐺‘𝑎) ∈ ran 𝐺)
9	7, 3, 8	syl2an2r 698	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → (𝐺‘𝑎) ∈ ran 𝐺)
10		simprr 785	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))
11		rspceov 7462	. . . . 5 ⊢ (((𝐹‘𝑎) ∈ ran 𝐹 ∧ (𝐺‘𝑎) ∈ ran 𝐺 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎))) → ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦))
12	5, 9, 10, 11	syl3anc 1398	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦))
13	12	rexlimdvaa 3164	. . 3 ⊢ (𝜑 → (∃𝑎 ∈ 𝐴 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)) → ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
14	13	ss2abdv 4013	. 2 ⊢ (𝜑 → {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎))} ⊆ {𝑧 ∣ ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)})
15		ofrn.4	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
16		inidm 4172	. . . . 5 ⊢ (𝐴 ∩ 𝐴) = 𝐴
17		eqidd 2761	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) = (𝐹‘𝑎))
18		eqidd 2761	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐺‘𝑎) = (𝐺‘𝑎))
19	2, 7, 15, 15, 16, 17, 18	offval 7687	. . . 4 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) = (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))))
20	19	rneqd 5922	. . 3 ⊢ (𝜑 → ran (𝐹 ∘f + 𝐺) = ran (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))))
21		eqid 2760	. . . 4 ⊢ (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))) = (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎)))
22	21	rnmpt 5941	. . 3 ⊢ ran (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))) = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎))}
23	20, 22	eqtrdi 2811	. 2 ⊢ (𝜑 → ran (𝐹 ∘f + 𝐺) = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎))})
24		ofrn.3	. . . . 5 ⊢ (𝜑 → + :(𝐵 × 𝐵)⟶𝐶)
25	24	ffnd 6703	. . . 4 ⊢ (𝜑 → + Fn (𝐵 × 𝐵))
26	1	frnd 6711	. . . . 5 ⊢ (𝜑 → ran 𝐹 ⊆ 𝐵)
27	6	frnd 6711	. . . . 5 ⊢ (𝜑 → ran 𝐺 ⊆ 𝐵)
28		xpss12 5670	. . . . 5 ⊢ ((ran 𝐹 ⊆ 𝐵 ∧ ran 𝐺 ⊆ 𝐵) → (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵))
29	26, 27, 28	syl2anc 596	. . . 4 ⊢ (𝜑 → (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵))
30		ovelimab 7592	. . . 4 ⊢ (( + Fn (𝐵 × 𝐵) ∧ (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵)) → (𝑧 ∈ ( + “ (ran 𝐹 × ran 𝐺)) ↔ ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
31	25, 29, 30	syl2anc 596	. . 3 ⊢ (𝜑 → (𝑧 ∈ ( + “ (ran 𝐹 × ran 𝐺)) ↔ ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
32	31	eqabdv 2893	. 2 ⊢ (𝜑 → ( + “ (ran 𝐹 × ran 𝐺)) = {𝑧 ∣ ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)})
33	14, 23, 32	3sstr4d 3986	1 ⊢ (𝜑 → ran (𝐹 ∘f + 𝐺) ⊆ ( + “ (ran 𝐹 × ran 𝐺)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2738  ∃wrex 3086   ⊆ wss 3899   ↦ cmpt 5186   × cxp 5653  ran crn 5656   “ cima 5658   Fn wfn 6528  ⟶wf 6529  ‘cfv 6533  (class class class)co 7413   ∘_f cof 7676

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 7416  df-oprab 7417  df-mpo 7418  df-of 7678

This theorem is used by:  sibfof  34851