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

Theorem rnmposs 33249
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
rnmposs.1 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
Assertion
Ref Expression
rnmposs (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 → ran 𝐹 ⊆ 𝐷)
Distinct variable groups:   𝑦,𝐴   𝑥,𝑦,𝐷
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥, 𝑦)   𝐶(𝑥, 𝑦)   𝐹(𝑥, 𝑦)

Proof of Theorem rnmposs
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 rnmposs.1 . . . . 5 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
21rnmpo 7545 . . . 4 ran 𝐹 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶}
32eqabri 2903 . . 3 (𝑧 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶)
4 2r19.29 3149 . . . . 5 ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶) → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐶 ∈ 𝐷 ∧ 𝑧 = 𝐶))
5 eleq1 2849 . . . . . . . 8 (𝑧 = 𝐶 → (𝑧 ∈ 𝐷 ↔ 𝐶 ∈ 𝐷))
65biimparc 485 . . . . . . 7 ((𝐶 ∈ 𝐷 ∧ 𝑧 = 𝐶) → 𝑧 ∈ 𝐷)
76a1i 11 . . . . . 6 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ((𝐶 ∈ 𝐷 ∧ 𝑧 = 𝐶) → 𝑧 ∈ 𝐷))
87rexlimivv 3205 . . . . 5 (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐶 ∈ 𝐷 ∧ 𝑧 = 𝐶) → 𝑧 ∈ 𝐷)
94, 8syl 18 . . . 4 ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶) → 𝑧 ∈ 𝐷)
109ex 418 . . 3 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 𝐶 → 𝑧 ∈ 𝐷))
113, 10biimtrid 245 . 2 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 → (𝑧 ∈ ran 𝐹 → 𝑧 ∈ 𝐷))
1211ssrdv 3937 1 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 → ran 𝐹 ⊆ 𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087   ⊆ wss 3899  ran crn 5652   ∈ cmpo 7414
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391
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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-cnv 5659  df-dm 5661  df-rn 5662  df-oprab 7416  df-mpo 7417
This theorem is used by:  fedgmul  34245  raddcn  34543  br2base  34884  sxbrsiga  34905
  Copyright terms: Public domain W3C validator