Theorem ofrn2 33332

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 6740	. . . . . 6 ⊢ (𝜑 → 𝐹 Fn 𝐴)
3		simprl 783	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → 𝑎 ∈ 𝐴)
4		fnfvelrn 7112	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) ∈ ran 𝐹)
5	2, 3, 4	syl2an2r 698	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → (𝐹‘𝑎) ∈ ran 𝐹)
6		ofrn.2	. . . . . . 7 ⊢ (𝜑 → 𝐺:𝐴⟶𝐵)
7	6	ffnd 6740	. . . . . 6 ⊢ (𝜑 → 𝐺 Fn 𝐴)
8		fnfvelrn 7112	. . . . . 6 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑎 ∈ 𝐴) → (𝐺‘𝑎) ∈ ran 𝐺)
9	7, 3, 8	syl2an2r 698	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → (𝐺‘𝑎) ∈ ran 𝐺)
10		simprr 785	. . . . 5 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))
11		rspceov 7500	. . . . 5 ⊢ (((𝐹‘𝑎) ∈ ran 𝐹 ∧ (𝐺‘𝑎) ∈ ran 𝐺 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎))) → ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦))
12	5, 9, 10, 11	syl3anc 1399	. . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐴 ∧ 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)))) → ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦))
13	12	rexlimdvaa 3168	. . 3 ⊢ (𝜑 → (∃𝑎 ∈ 𝐴 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎)) → ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
14	13	ss2abdv 3993	. 2 ⊢ (𝜑 → {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎))} ⊆ {𝑧 ∣ ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)})
15		ofrn.4	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
16		inidm 4126	. . . . 5 ⊢ (𝐴 ∩ 𝐴) = 𝐴
17		eqidd 2764	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) = (𝐹‘𝑎))
18		eqidd 2764	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐺‘𝑎) = (𝐺‘𝑎))
19	2, 7, 15, 15, 16, 17, 18	offval 7734	. . . 4 ⊢ (𝜑 → (𝐹 ∘f + 𝐺) = (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))))
20	19	rneqd 5932	. . 3 ⊢ (𝜑 → ran (𝐹 ∘f + 𝐺) = ran (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))))
21		eqid 2763	. . . 4 ⊢ (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))) = (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎)))
22	21	rnmpt 5951	. . 3 ⊢ ran (𝑎 ∈ 𝐴 ↦ ((𝐹‘𝑎) + (𝐺‘𝑎))) = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎))}
23	20, 22	eqtrdi 2814	. 2 ⊢ (𝜑 → ran (𝐹 ∘f + 𝐺) = {𝑧 ∣ ∃𝑎 ∈ 𝐴 𝑧 = ((𝐹‘𝑎) + (𝐺‘𝑎))})
24		ofrn.3	. . . . 5 ⊢ (𝜑 → + :(𝐵 × 𝐵)⟶𝐶)
25	24	ffnd 6740	. . . 4 ⊢ (𝜑 → + Fn (𝐵 × 𝐵))
26	1	frnd 6748	. . . . 5 ⊢ (𝜑 → ran 𝐹 ⊆ 𝐵)
27	6	frnd 6748	. . . . 5 ⊢ (𝜑 → ran 𝐺 ⊆ 𝐵)
28		xpss12 5673	. . . . 5 ⊢ ((ran 𝐹 ⊆ 𝐵 ∧ ran 𝐺 ⊆ 𝐵) → (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵))
29	26, 27, 28	syl2anc 596	. . . 4 ⊢ (𝜑 → (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵))
30		ovelimab 7631	. . . 4 ⊢ (( + Fn (𝐵 × 𝐵) ∧ (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵)) → (𝑧 ∈ ( + “ (ran 𝐹 × ran 𝐺)) ↔ ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
31	25, 29, 30	syl2anc 596	. . 3 ⊢ (𝜑 → (𝑧 ∈ ( + “ (ran 𝐹 × ran 𝐺)) ↔ ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
32	31	eqabdv 2897	. 2 ⊢ (𝜑 → ( + “ (ran 𝐹 × ran 𝐺)) = {𝑧 ∣ ∃𝑥 ∈ ran 𝐹∃𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)})
33	14, 23, 32	3sstr4d 3968	1 ⊢ (𝜑 → ran (𝐹 ∘f + 𝐺) ⊆ ( + “ (ran 𝐹 × ran 𝐺)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741  ∃wrex 3090   ⊆ wss 3900   ↦ cmpt 5192   × cxp 5656  ran crn 5659   “ cima 5661   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451   ∘_f cof 7723

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-of 7725

This theorem is used by:  sibfof  35083