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

Theorem rnmpt2ss 29473
Description: The range of an operation given by the "maps to" notation as a subset. (Contributed by Thierry Arnoux, 23-May-2017.)
Hypothesis
Ref Expression
rnmpt2ss.1 𝐹 = (𝑥𝐴, 𝑦𝐵𝐶)
Assertion
Ref Expression
rnmpt2ss (∀𝑥𝐴𝑦𝐵 𝐶𝐷 → ran 𝐹𝐷)
Distinct variable groups:   𝑦,𝐴   𝑥,𝑦,𝐷
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)   𝐹(𝑥,𝑦)

Proof of Theorem rnmpt2ss
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 rnmpt2ss.1 . . . . 5 𝐹 = (𝑥𝐴, 𝑦𝐵𝐶)
21rnmpt2 6770 . . . 4 ran 𝐹 = {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶}
32abeq2i 2735 . . 3 (𝑧 ∈ ran 𝐹 ↔ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶)
4 simpl 473 . . . . . 6 ((∀𝑥𝐴𝑦𝐵 𝐶𝐷 ∧ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶) → ∀𝑥𝐴𝑦𝐵 𝐶𝐷)
5 simpr 477 . . . . . 6 ((∀𝑥𝐴𝑦𝐵 𝐶𝐷 ∧ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶) → ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶)
64, 5r19.29d2r 3080 . . . . 5 ((∀𝑥𝐴𝑦𝐵 𝐶𝐷 ∧ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶) → ∃𝑥𝐴𝑦𝐵 (𝐶𝐷𝑧 = 𝐶))
7 eleq1 2689 . . . . . . . 8 (𝑧 = 𝐶 → (𝑧𝐷𝐶𝐷))
87biimparc 504 . . . . . . 7 ((𝐶𝐷𝑧 = 𝐶) → 𝑧𝐷)
98a1i 11 . . . . . 6 ((𝑥𝐴𝑦𝐵) → ((𝐶𝐷𝑧 = 𝐶) → 𝑧𝐷))
109rexlimivv 3036 . . . . 5 (∃𝑥𝐴𝑦𝐵 (𝐶𝐷𝑧 = 𝐶) → 𝑧𝐷)
116, 10syl 17 . . . 4 ((∀𝑥𝐴𝑦𝐵 𝐶𝐷 ∧ ∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶) → 𝑧𝐷)
1211ex 450 . . 3 (∀𝑥𝐴𝑦𝐵 𝐶𝐷 → (∃𝑥𝐴𝑦𝐵 𝑧 = 𝐶𝑧𝐷))
133, 12syl5bi 232 . 2 (∀𝑥𝐴𝑦𝐵 𝐶𝐷 → (𝑧 ∈ ran 𝐹𝑧𝐷))
1413ssrdv 3609 1 (∀𝑥𝐴𝑦𝐵 𝐶𝐷 → ran 𝐹𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1483  wcel 1990  wral 2912  wrex 2913  wss 3574  ran crn 5115  cmpt2 6652
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-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-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  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-br 4654  df-opab 4713  df-cnv 5122  df-dm 5124  df-rn 5125  df-oprab 6654  df-mpt2 6655
This theorem is referenced by:  raddcn  29975  br2base  30331  sxbrsiga  30352
  Copyright terms: Public domain W3C validator