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

Theorem unipreima 33237
Description: Preimage of a class union. (Contributed by Thierry Arnoux, 7-Feb-2017.)
Assertion
Ref Expression
unipreima (Fun 𝐹 → (◡𝐹 “ ∪ 𝐴) = ∪ 𝑥 ∈ 𝐴 (◡𝐹 “ 𝑥))
Distinct variable groups:   𝑥,𝐹   𝑥,𝐴

Proof of Theorem unipreima
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 funfn 6570 . 2 (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
2 r19.42v 3195 . . . . . . 7 (∃𝑥 ∈ 𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ 𝑥) ↔ (𝑦 ∈ dom 𝐹 ∧ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝑥))
32bicomi 227 . . . . . 6 ((𝑦 ∈ dom 𝐹 ∧ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝑥) ↔ ∃𝑥 ∈ 𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ 𝑥))
43a1i 11 . . . . 5 (𝐹 Fn dom 𝐹 → ((𝑦 ∈ dom 𝐹 ∧ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝑥) ↔ ∃𝑥 ∈ 𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ 𝑥)))
5 eluni2 4871 . . . . . . 7 ((𝐹‘𝑦) ∈ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝑥)
65anbi2i 635 . . . . . 6 ((𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ ∪ 𝐴) ↔ (𝑦 ∈ dom 𝐹 ∧ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝑥))
76a1i 11 . . . . 5 (𝐹 Fn dom 𝐹 → ((𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ ∪ 𝐴) ↔ (𝑦 ∈ dom 𝐹 ∧ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝑥)))
8 elpreima 7057 . . . . . 6 (𝐹 Fn dom 𝐹 → (𝑦 ∈ (◡𝐹 “ 𝑥) ↔ (𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ 𝑥)))
98rexbidv 3187 . . . . 5 (𝐹 Fn dom 𝐹 → (∃𝑥 ∈ 𝐴 𝑦 ∈ (◡𝐹 “ 𝑥) ↔ ∃𝑥 ∈ 𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ 𝑥)))
104, 7, 93bitr4d 314 . . . 4 (𝐹 Fn dom 𝐹 → ((𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ ∪ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ (◡𝐹 “ 𝑥)))
11 elpreima 7057 . . . 4 (𝐹 Fn dom 𝐹 → (𝑦 ∈ (◡𝐹 “ ∪ 𝐴) ↔ (𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ ∪ 𝐴)))
12 eliun 4955 . . . . 5 (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (◡𝐹 “ 𝑥) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ (◡𝐹 “ 𝑥))
1312a1i 11 . . . 4 (𝐹 Fn dom 𝐹 → (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (◡𝐹 “ 𝑥) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ (◡𝐹 “ 𝑥)))
1410, 11, 133bitr4d 314 . . 3 (𝐹 Fn dom 𝐹 → (𝑦 ∈ (◡𝐹 “ ∪ 𝐴) ↔ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (◡𝐹 “ 𝑥)))
1514eqrdv 2759 . 2 (𝐹 Fn dom 𝐹 → (◡𝐹 “ ∪ 𝐴) = ∪ 𝑥 ∈ 𝐴 (◡𝐹 “ 𝑥))
161, 15sylbi 220 1 (Fun 𝐹 → (◡𝐹 “ ∪ 𝐴) = ∪ 𝑥 ∈ 𝐴 (◡𝐹 “ 𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  ∪ cuni 4867  ∪ ciun 4951  ◡ccnv 5650  dom cdm 5651   “ cima 5654  Fun wfun 6532   Fn wfn 6533  ‘cfv 6538
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-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  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-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  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-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546
This theorem is used by:  imambfm  34894  dstrvprob  35104
  Copyright terms: Public domain W3C validator