Theorem ofrn2 29442

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 (𝐹 ∘𝑓 + 𝐺) ⊆ ( + “ (ran 𝐹 × ran 𝐺)))

Proof of Theorem ofrn2

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

Step	Hyp	Ref	Expression
1		ofrn.1	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
2		ffn 6045	. . . . . . . 8 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
3	1, 2	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐹 Fn 𝐴)
4	3	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → 𝐹 Fn 𝐴)
5		simprl 794	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → 𝑎 ∈ 𝐴)
6		fnfvelrn 6356	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) ∈ ran 𝐹)
7	4, 5, 6	syl2anc 693	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → (𝐹‘𝑎) ∈ ran 𝐹)
8		ofrn.2	. . . . . . . 8 ⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
9		ffn 6045	. . . . . . . 8 ⊢ (𝐺:𝐴⟶𝐵 → 𝐺 Fn 𝐴)
10	8, 9	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐺 Fn 𝐴)
11	10	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → 𝐺 Fn 𝐴)
12		fnfvelrn 6356	. . . . . 6 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑎 ∈ 𝐴) → (𝐺‘𝑎) ∈ ran 𝐺)
13	11, 5, 12	syl2anc 693	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → (𝐺‘𝑎) ∈ ran 𝐺)
14		simprr 796	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))
15		rspceov 6692	. . . . 5 ⊢ (((𝐹‘𝑎) ∈ ran 𝐹 ∧ (𝐺‘𝑎) ∈ ran 𝐺 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎))) → ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦))
16	7, 13, 14, 15	syl3anc 1326	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦))
17	16	rexlimdvaa 3032	. . 3 ⊢ (𝜑 → (∃𝑎 ∈ 𝐴 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)) → ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
18	17	ss2abdv 3675	. 2 ⊢ (𝜑 → {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎))} ⊆ {𝑧 ∣ ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)})
19		ofrn.4	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
20		inidm 3822	. . . . 5 ⊢ (𝐴 ∩ 𝐴) = 𝐴
21		eqidd 2623	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) = (𝐹‘𝑎))
22		eqidd 2623	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐺‘𝑎) = (𝐺‘𝑎))
23	3, 10, 19, 19, 20, 21, 22	offval 6904	. . . 4 ⊢ (𝜑 → (𝐹 ∘𝑓 + 𝐺) = (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))))
24	23	rneqd 5353	. . 3 ⊢ (𝜑 → ran (𝐹 ∘𝑓 + 𝐺) = ran (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))))
25		eqid 2622	. . . 4 ⊢ (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))) = (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎)))
26	25	rnmpt 5371	. . 3 ⊢ ran (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))) = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎))}
27	24, 26	syl6eq 2672	. 2 ⊢ (𝜑 → ran (𝐹 ∘𝑓 + 𝐺) = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎))})
28		ofrn.3	. . . . 5 ⊢ (𝜑 → + :(𝐵 × 𝐵)⟶𝐶)
29		ffn 6045	. . . . 5 ⊢ ( + :(𝐵 × 𝐵)⟶𝐶 → + Fn (𝐵 × 𝐵))
30	28, 29	syl 17	. . . 4 ⊢ (𝜑 → + Fn (𝐵 × 𝐵))
31		frn 6053	. . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → ran 𝐹 ⊆ 𝐵)
32	1, 31	syl 17	. . . . 5 ⊢ (𝜑 → ran 𝐹 ⊆ 𝐵)
33		frn 6053	. . . . . 6 ⊢ (𝐺:𝐴⟶𝐵 → ran 𝐺 ⊆ 𝐵)
34	8, 33	syl 17	. . . . 5 ⊢ (𝜑 → ran 𝐺 ⊆ 𝐵)
35		xpss12 5225	. . . . 5 ⊢ ((ran 𝐹 ⊆ 𝐵 ∧ ran 𝐺 ⊆ 𝐵) → (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵))
36	32, 34, 35	syl2anc 693	. . . 4 ⊢ (𝜑 → (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵))
37		ovelimab 6812	. . . 4 ⊢ (( + Fn (𝐵 × 𝐵) ∧ (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵)) → (𝑧 ∈ ( + “ (ran 𝐹 × ran 𝐺)) ↔ ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
38	30, 36, 37	syl2anc 693	. . 3 ⊢ (𝜑 → (𝑧 ∈ ( + “ (ran 𝐹 × ran 𝐺)) ↔ ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
39	38	abbi2dv 2742	. 2 ⊢ (𝜑 → ( + “ (ran 𝐹 × ran 𝐺)) = {𝑧 ∣ ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)})
40	18, 27, 39	3sstr4d 3648	1 ⊢ (𝜑 → ran (𝐹 ∘𝑓 + 𝐺) ⊆ ( + “ (ran 𝐹 × ran 𝐺)))

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1483   ∈ wcel 1990  {cab 2608  ∃wrex 2913   ⊆ wss 3574   ↦ cmpt 4729   × cxp 5112  ran crn 5115   “ cima 5117   Fn wfn 5883  ⟶wf 5884  ‘cfv 5888  (class class class)co 6650   ∘_𝑓 cof 6895

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-of 6897

This theorem is referenced by:  sibfof  30402