Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ofrn2 Structured version   Visualization version   GIF version

Theorem ofrn2 30401
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.
StepHypRef Expression
1 ofrn.1 . . . . . . 7 (𝜑𝐹:𝐴𝐵)
21ffnd 6488 . . . . . 6 (𝜑𝐹 Fn 𝐴)
3 simprl 770 . . . . . 6 ((𝜑 ∧ (𝑎𝐴𝑧 = ((𝐹𝑎) + (𝐺𝑎)))) → 𝑎𝐴)
4 fnfvelrn 6825 . . . . . 6 ((𝐹 Fn 𝐴𝑎𝐴) → (𝐹𝑎) ∈ ran 𝐹)
52, 3, 4syl2an2r 684 . . . . 5 ((𝜑 ∧ (𝑎𝐴𝑧 = ((𝐹𝑎) + (𝐺𝑎)))) → (𝐹𝑎) ∈ ran 𝐹)
6 ofrn.2 . . . . . . 7 (𝜑𝐺:𝐴𝐵)
76ffnd 6488 . . . . . 6 (𝜑𝐺 Fn 𝐴)
8 fnfvelrn 6825 . . . . . 6 ((𝐺 Fn 𝐴𝑎𝐴) → (𝐺𝑎) ∈ ran 𝐺)
97, 3, 8syl2an2r 684 . . . . 5 ((𝜑 ∧ (𝑎𝐴𝑧 = ((𝐹𝑎) + (𝐺𝑎)))) → (𝐺𝑎) ∈ ran 𝐺)
10 simprr 772 . . . . 5 ((𝜑 ∧ (𝑎𝐴𝑧 = ((𝐹𝑎) + (𝐺𝑎)))) → 𝑧 = ((𝐹𝑎) + (𝐺𝑎)))
11 rspceov 7182 . . . . 5 (((𝐹𝑎) ∈ ran 𝐹 ∧ (𝐺𝑎) ∈ ran 𝐺𝑧 = ((𝐹𝑎) + (𝐺𝑎))) → ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦))
125, 9, 10, 11syl3anc 1368 . . . 4 ((𝜑 ∧ (𝑎𝐴𝑧 = ((𝐹𝑎) + (𝐺𝑎)))) → ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦))
1312rexlimdvaa 3244 . . 3 (𝜑 → (∃𝑎𝐴 𝑧 = ((𝐹𝑎) + (𝐺𝑎)) → ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
1413ss2abdv 3991 . 2 (𝜑 → {𝑧 ∣ ∃𝑎𝐴 𝑧 = ((𝐹𝑎) + (𝐺𝑎))} ⊆ {𝑧 ∣ ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)})
15 ofrn.4 . . . . 5 (𝜑𝐴𝑉)
16 inidm 4145 . . . . 5 (𝐴𝐴) = 𝐴
17 eqidd 2799 . . . . 5 ((𝜑𝑎𝐴) → (𝐹𝑎) = (𝐹𝑎))
18 eqidd 2799 . . . . 5 ((𝜑𝑎𝐴) → (𝐺𝑎) = (𝐺𝑎))
192, 7, 15, 15, 16, 17, 18offval 7396 . . . 4 (𝜑 → (𝐹f + 𝐺) = (𝑎𝐴 ↦ ((𝐹𝑎) + (𝐺𝑎))))
2019rneqd 5772 . . 3 (𝜑 → ran (𝐹f + 𝐺) = ran (𝑎𝐴 ↦ ((𝐹𝑎) + (𝐺𝑎))))
21 eqid 2798 . . . 4 (𝑎𝐴 ↦ ((𝐹𝑎) + (𝐺𝑎))) = (𝑎𝐴 ↦ ((𝐹𝑎) + (𝐺𝑎)))
2221rnmpt 5791 . . 3 ran (𝑎𝐴 ↦ ((𝐹𝑎) + (𝐺𝑎))) = {𝑧 ∣ ∃𝑎𝐴 𝑧 = ((𝐹𝑎) + (𝐺𝑎))}
2320, 22eqtrdi 2849 . 2 (𝜑 → ran (𝐹f + 𝐺) = {𝑧 ∣ ∃𝑎𝐴 𝑧 = ((𝐹𝑎) + (𝐺𝑎))})
24 ofrn.3 . . . . 5 (𝜑+ :(𝐵 × 𝐵)⟶𝐶)
2524ffnd 6488 . . . 4 (𝜑+ Fn (𝐵 × 𝐵))
261frnd 6494 . . . . 5 (𝜑 → ran 𝐹𝐵)
276frnd 6494 . . . . 5 (𝜑 → ran 𝐺𝐵)
28 xpss12 5534 . . . . 5 ((ran 𝐹𝐵 ∧ ran 𝐺𝐵) → (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵))
2926, 27, 28syl2anc 587 . . . 4 (𝜑 → (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵))
30 ovelimab 7306 . . . 4 (( + Fn (𝐵 × 𝐵) ∧ (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵)) → (𝑧 ∈ ( + “ (ran 𝐹 × ran 𝐺)) ↔ ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
3125, 29, 30syl2anc 587 . . 3 (𝜑 → (𝑧 ∈ ( + “ (ran 𝐹 × ran 𝐺)) ↔ ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
3231abbi2dv 2927 . 2 (𝜑 → ( + “ (ran 𝐹 × ran 𝐺)) = {𝑧 ∣ ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)})
3314, 23, 323sstr4d 3962 1 (𝜑 → ran (𝐹f + 𝐺) ⊆ ( + “ (ran 𝐹 × ran 𝐺)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1538  wcel 2111  {cab 2776  wrex 3107  wss 3881  cmpt 5110   × cxp 5517  ran crn 5520  cima 5522   Fn wfn 6319  wf 6320  cfv 6324  (class class class)co 7135  f cof 7387
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pr 5295
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-of 7389
This theorem is referenced by:  sibfof  31708
  Copyright terms: Public domain W3C validator