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

Theorem iunpreima 32765
Description: Preimage of an indexed union. (Contributed by Thierry Arnoux, 27-Mar-2018.)
Assertion
Ref Expression
iunpreima (Fun 𝐹 → (𝐹 𝑥𝐴 𝐵) = 𝑥𝐴 (𝐹𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem iunpreima
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eliun 4954 . . . . 5 ((𝐹𝑦) ∈ 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴 (𝐹𝑦) ∈ 𝐵)
21a1i 11 . . . 4 (Fun 𝐹 → ((𝐹𝑦) ∈ 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴 (𝐹𝑦) ∈ 𝐵))
32rabbidv 3422 . . 3 (Fun 𝐹 → {𝑦 ∈ dom 𝐹 ∣ (𝐹𝑦) ∈ 𝑥𝐴 𝐵} = {𝑦 ∈ dom 𝐹 ∣ ∃𝑥𝐴 (𝐹𝑦) ∈ 𝐵})
4 funfn 6552 . . . 4 (Fun 𝐹𝐹 Fn dom 𝐹)
5 fncnvima2 7043 . . . 4 (𝐹 Fn dom 𝐹 → (𝐹 𝑥𝐴 𝐵) = {𝑦 ∈ dom 𝐹 ∣ (𝐹𝑦) ∈ 𝑥𝐴 𝐵})
64, 5sylbi 219 . . 3 (Fun 𝐹 → (𝐹 𝑥𝐴 𝐵) = {𝑦 ∈ dom 𝐹 ∣ (𝐹𝑦) ∈ 𝑥𝐴 𝐵})
7 iunrab 5011 . . . 4 𝑥𝐴 {𝑦 ∈ dom 𝐹 ∣ (𝐹𝑦) ∈ 𝐵} = {𝑦 ∈ dom 𝐹 ∣ ∃𝑥𝐴 (𝐹𝑦) ∈ 𝐵}
87a1i 11 . . 3 (Fun 𝐹 𝑥𝐴 {𝑦 ∈ dom 𝐹 ∣ (𝐹𝑦) ∈ 𝐵} = {𝑦 ∈ dom 𝐹 ∣ ∃𝑥𝐴 (𝐹𝑦) ∈ 𝐵})
93, 6, 83eqtr4d 2808 . 2 (Fun 𝐹 → (𝐹 𝑥𝐴 𝐵) = 𝑥𝐴 {𝑦 ∈ dom 𝐹 ∣ (𝐹𝑦) ∈ 𝐵})
10 fncnvima2 7043 . . . 4 (𝐹 Fn dom 𝐹 → (𝐹𝐵) = {𝑦 ∈ dom 𝐹 ∣ (𝐹𝑦) ∈ 𝐵})
114, 10sylbi 219 . . 3 (Fun 𝐹 → (𝐹𝐵) = {𝑦 ∈ dom 𝐹 ∣ (𝐹𝑦) ∈ 𝐵})
1211iuneq2d 4981 . 2 (Fun 𝐹 𝑥𝐴 (𝐹𝐵) = 𝑥𝐴 {𝑦 ∈ dom 𝐹 ∣ (𝐹𝑦) ∈ 𝐵})
139, 12eqtr4d 2801 1 (Fun 𝐹 → (𝐹 𝑥𝐴 𝐵) = 𝑥𝐴 (𝐹𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1561  wcel 2143  wrex 3087  {crab 3415   ciun 4950  ccnv 5647  dom cdm 5648  cima 5651  Fun wfun 6516   Fn wfn 6517  cfv 6522
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5247  ax-nul 5257  ax-pr 5391
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3078  df-rex 3088  df-rab 3416  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5102  df-opab 5164  df-id 5543  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-iota 6478  df-fun 6524  df-fn 6525  df-fv 6530
This theorem is referenced by:  elrspunidl  33615
  Copyright terms: Public domain W3C validator