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

Theorem iunrnmptss 30914
Description: A subset relation for an indexed union over the range of function expressed as a mapping. (Contributed by Thierry Arnoux, 27-Mar-2018.)
Hypotheses
Ref Expression
iunrnmptss.1 (𝑦 = 𝐵𝐶 = 𝐷)
iunrnmptss.2 ((𝜑𝑥𝐴) → 𝐵𝑉)
Assertion
Ref Expression
iunrnmptss (𝜑 𝑦 ∈ ran (𝑥𝐴𝐵)𝐶 𝑥𝐴 𝐷)
Distinct variable groups:   𝑦,𝐴   𝑥,𝐶   𝑦,𝐷   𝜑,𝑥,𝑦
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥,𝑦)   𝐶(𝑦)   𝐷(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem iunrnmptss
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-rex 3072 . . . 4 (∃𝑦 ∈ ran (𝑥𝐴𝐵)𝑧𝐶 ↔ ∃𝑦(𝑦 ∈ ran (𝑥𝐴𝐵) ∧ 𝑧𝐶))
2 iunrnmptss.2 . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝐵𝑉)
32ralrimiva 3110 . . . . . . . 8 (𝜑 → ∀𝑥𝐴 𝐵𝑉)
4 eqid 2740 . . . . . . . . 9 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
54elrnmptg 5867 . . . . . . . 8 (∀𝑥𝐴 𝐵𝑉 → (𝑦 ∈ ran (𝑥𝐴𝐵) ↔ ∃𝑥𝐴 𝑦 = 𝐵))
63, 5syl 17 . . . . . . 7 (𝜑 → (𝑦 ∈ ran (𝑥𝐴𝐵) ↔ ∃𝑥𝐴 𝑦 = 𝐵))
76anbi1d 630 . . . . . 6 (𝜑 → ((𝑦 ∈ ran (𝑥𝐴𝐵) ∧ 𝑧𝐶) ↔ (∃𝑥𝐴 𝑦 = 𝐵𝑧𝐶)))
87exbidv 1928 . . . . 5 (𝜑 → (∃𝑦(𝑦 ∈ ran (𝑥𝐴𝐵) ∧ 𝑧𝐶) ↔ ∃𝑦(∃𝑥𝐴 𝑦 = 𝐵𝑧𝐶)))
9 r19.41v 3276 . . . . . . 7 (∃𝑥𝐴 (𝑦 = 𝐵𝑧𝐶) ↔ (∃𝑥𝐴 𝑦 = 𝐵𝑧𝐶))
10 iunrnmptss.1 . . . . . . . . . 10 (𝑦 = 𝐵𝐶 = 𝐷)
1110eleq2d 2826 . . . . . . . . 9 (𝑦 = 𝐵 → (𝑧𝐶𝑧𝐷))
1211biimpa 477 . . . . . . . 8 ((𝑦 = 𝐵𝑧𝐶) → 𝑧𝐷)
1312reximi 3177 . . . . . . 7 (∃𝑥𝐴 (𝑦 = 𝐵𝑧𝐶) → ∃𝑥𝐴 𝑧𝐷)
149, 13sylbir 234 . . . . . 6 ((∃𝑥𝐴 𝑦 = 𝐵𝑧𝐶) → ∃𝑥𝐴 𝑧𝐷)
1514exlimiv 1937 . . . . 5 (∃𝑦(∃𝑥𝐴 𝑦 = 𝐵𝑧𝐶) → ∃𝑥𝐴 𝑧𝐷)
168, 15syl6bi 252 . . . 4 (𝜑 → (∃𝑦(𝑦 ∈ ran (𝑥𝐴𝐵) ∧ 𝑧𝐶) → ∃𝑥𝐴 𝑧𝐷))
171, 16syl5bi 241 . . 3 (𝜑 → (∃𝑦 ∈ ran (𝑥𝐴𝐵)𝑧𝐶 → ∃𝑥𝐴 𝑧𝐷))
1817ss2abdv 4002 . 2 (𝜑 → {𝑧 ∣ ∃𝑦 ∈ ran (𝑥𝐴𝐵)𝑧𝐶} ⊆ {𝑧 ∣ ∃𝑥𝐴 𝑧𝐷})
19 df-iun 4932 . 2 𝑦 ∈ ran (𝑥𝐴𝐵)𝐶 = {𝑧 ∣ ∃𝑦 ∈ ran (𝑥𝐴𝐵)𝑧𝐶}
20 df-iun 4932 . 2 𝑥𝐴 𝐷 = {𝑧 ∣ ∃𝑥𝐴 𝑧𝐷}
2118, 19, 203sstr4g 3971 1 (𝜑 𝑦 ∈ ran (𝑥𝐴𝐵)𝐶 𝑥𝐴 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1542  wex 1786  wcel 2110  {cab 2717  wral 3066  wrex 3067  wss 3892   ciun 4930  cmpt 5162  ran crn 5591
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2015  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2711  ax-sep 5227  ax-nul 5234  ax-pr 5356
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2072  df-mo 2542  df-eu 2571  df-clab 2718  df-cleq 2732  df-clel 2818  df-nfc 2891  df-ral 3071  df-rex 3072  df-rab 3075  df-v 3433  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-sn 4568  df-pr 4570  df-op 4574  df-iun 4932  df-br 5080  df-opab 5142  df-mpt 5163  df-cnv 5598  df-dm 5600  df-rn 5601
This theorem is referenced by:  fnpreimac  31017
  Copyright terms: Public domain W3C validator