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 32922
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 6704 . . . . . 6 (𝜑𝐹 Fn 𝐴)
3 simprl 782 . . . . . 6 ((𝜑 ∧ (𝑎𝐴𝑧 = ((𝐹𝑎) + (𝐺𝑎)))) → 𝑎𝐴)
4 fnfvelrn 7073 . . . . . 6 ((𝐹 Fn 𝐴𝑎𝐴) → (𝐹𝑎) ∈ ran 𝐹)
52, 3, 4syl2an2r 697 . . . . 5 ((𝜑 ∧ (𝑎𝐴𝑧 = ((𝐹𝑎) + (𝐺𝑎)))) → (𝐹𝑎) ∈ ran 𝐹)
6 ofrn.2 . . . . . . 7 (𝜑𝐺:𝐴𝐵)
76ffnd 6704 . . . . . 6 (𝜑𝐺 Fn 𝐴)
8 fnfvelrn 7073 . . . . . 6 ((𝐺 Fn 𝐴𝑎𝐴) → (𝐺𝑎) ∈ ran 𝐺)
97, 3, 8syl2an2r 697 . . . . 5 ((𝜑 ∧ (𝑎𝐴𝑧 = ((𝐹𝑎) + (𝐺𝑎)))) → (𝐺𝑎) ∈ ran 𝐺)
10 simprr 784 . . . . 5 ((𝜑 ∧ (𝑎𝐴𝑧 = ((𝐹𝑎) + (𝐺𝑎)))) → 𝑧 = ((𝐹𝑎) + (𝐺𝑎)))
11 rspceov 7457 . . . . 5 (((𝐹𝑎) ∈ ran 𝐹 ∧ (𝐺𝑎) ∈ ran 𝐺𝑧 = ((𝐹𝑎) + (𝐺𝑎))) → ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦))
125, 9, 10, 11syl3anc 1396 . . . 4 ((𝜑 ∧ (𝑎𝐴𝑧 = ((𝐹𝑎) + (𝐺𝑎)))) → ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦))
1312rexlimdvaa 3173 . . 3 (𝜑 → (∃𝑎𝐴 𝑧 = ((𝐹𝑎) + (𝐺𝑎)) → ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
1413ss2abdv 4027 . 2 (𝜑 → {𝑧 ∣ ∃𝑎𝐴 𝑧 = ((𝐹𝑎) + (𝐺𝑎))} ⊆ {𝑧 ∣ ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)})
15 ofrn.4 . . . . 5 (𝜑𝐴𝑉)
16 inidm 4187 . . . . 5 (𝐴𝐴) = 𝐴
17 eqidd 2770 . . . . 5 ((𝜑𝑎𝐴) → (𝐹𝑎) = (𝐹𝑎))
18 eqidd 2770 . . . . 5 ((𝜑𝑎𝐴) → (𝐺𝑎) = (𝐺𝑎))
192, 7, 15, 15, 16, 17, 18offval 7681 . . . 4 (𝜑 → (𝐹f + 𝐺) = (𝑎𝐴 ↦ ((𝐹𝑎) + (𝐺𝑎))))
2019rneqd 5926 . . 3 (𝜑 → ran (𝐹f + 𝐺) = ran (𝑎𝐴 ↦ ((𝐹𝑎) + (𝐺𝑎))))
21 eqid 2769 . . . 4 (𝑎𝐴 ↦ ((𝐹𝑎) + (𝐺𝑎))) = (𝑎𝐴 ↦ ((𝐹𝑎) + (𝐺𝑎)))
2221rnmpt 5945 . . 3 ran (𝑎𝐴 ↦ ((𝐹𝑎) + (𝐺𝑎))) = {𝑧 ∣ ∃𝑎𝐴 𝑧 = ((𝐹𝑎) + (𝐺𝑎))}
2320, 22eqtrdi 2820 . 2 (𝜑 → ran (𝐹f + 𝐺) = {𝑧 ∣ ∃𝑎𝐴 𝑧 = ((𝐹𝑎) + (𝐺𝑎))})
24 ofrn.3 . . . . 5 (𝜑+ :(𝐵 × 𝐵)⟶𝐶)
2524ffnd 6704 . . . 4 (𝜑+ Fn (𝐵 × 𝐵))
261frnd 6712 . . . . 5 (𝜑 → ran 𝐹𝐵)
276frnd 6712 . . . . 5 (𝜑 → ran 𝐺𝐵)
28 xpss12 5674 . . . . 5 ((ran 𝐹𝐵 ∧ ran 𝐺𝐵) → (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵))
2926, 27, 28syl2anc 595 . . . 4 (𝜑 → (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵))
30 ovelimab 7586 . . . 4 (( + Fn (𝐵 × 𝐵) ∧ (ran 𝐹 × ran 𝐺) ⊆ (𝐵 × 𝐵)) → (𝑧 ∈ ( + “ (ran 𝐹 × ran 𝐺)) ↔ ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
3125, 29, 30syl2anc 595 . . 3 (𝜑 → (𝑧 ∈ ( + “ (ran 𝐹 × ran 𝐺)) ↔ ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)))
3231eqabdv 2902 . 2 (𝜑 → ( + “ (ran 𝐹 × ran 𝐺)) = {𝑧 ∣ ∃𝑥 ∈ ran 𝐹𝑦 ∈ ran 𝐺 𝑧 = (𝑥 + 𝑦)})
3314, 23, 323sstr4d 4000 1 (𝜑 → ran (𝐹f + 𝐺) ⊆ ( + “ (ran 𝐹 × ran 𝐺)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  {cab 2747  wrex 3095  wss 3913  cmpt 5193   × cxp 5657  ran crn 5660  cima 5662   Fn wfn 6529  wf 6530  cfv 6534  (class class class)co 7408  f cof 7670
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pr 5402
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6490  df-fun 6536  df-fn 6537  df-f 6538  df-f1 6539  df-fo 6540  df-f1o 6541  df-fv 6542  df-ov 7411  df-oprab 7412  df-mpo 7413  df-of 7672
This theorem is referenced by:  sibfof  34671
  Copyright terms: Public domain W3C validator