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 33061
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 3199 . . . . . . 7 (∃𝑥𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝑥) ↔ (𝑦 ∈ dom 𝐹 ∧ ∃𝑥𝐴 (𝐹𝑦) ∈ 𝑥))
32bicomi 227 . . . . . 6 ((𝑦 ∈ dom 𝐹 ∧ ∃𝑥𝐴 (𝐹𝑦) ∈ 𝑥) ↔ ∃𝑥𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝑥))
43a1i 11 . . . . 5 (𝐹 Fn dom 𝐹 → ((𝑦 ∈ dom 𝐹 ∧ ∃𝑥𝐴 (𝐹𝑦) ∈ 𝑥) ↔ ∃𝑥𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝑥)))
5 eluni2 4878 . . . . . . 7 ((𝐹𝑦) ∈ 𝐴 ↔ ∃𝑥𝐴 (𝐹𝑦) ∈ 𝑥)
65anbi2i 635 . . . . . 6 ((𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝐴) ↔ (𝑦 ∈ dom 𝐹 ∧ ∃𝑥𝐴 (𝐹𝑦) ∈ 𝑥))
76a1i 11 . . . . 5 (𝐹 Fn dom 𝐹 → ((𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝐴) ↔ (𝑦 ∈ dom 𝐹 ∧ ∃𝑥𝐴 (𝐹𝑦) ∈ 𝑥)))
8 elpreima 7057 . . . . . 6 (𝐹 Fn dom 𝐹 → (𝑦 ∈ (𝐹𝑥) ↔ (𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝑥)))
98rexbidv 3191 . . . . 5 (𝐹 Fn dom 𝐹 → (∃𝑥𝐴 𝑦 ∈ (𝐹𝑥) ↔ ∃𝑥𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝑥)))
104, 7, 93bitr4d 314 . . . 4 (𝐹 Fn dom 𝐹 → ((𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝐴) ↔ ∃𝑥𝐴 𝑦 ∈ (𝐹𝑥)))
11 elpreima 7057 . . . 4 (𝐹 Fn dom 𝐹 → (𝑦 ∈ (𝐹 𝐴) ↔ (𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝐴)))
12 eliun 4962 . . . . 5 (𝑦 𝑥𝐴 (𝐹𝑥) ↔ ∃𝑥𝐴 𝑦 ∈ (𝐹𝑥))
1312a1i 11 . . . 4 (𝐹 Fn dom 𝐹 → (𝑦 𝑥𝐴 (𝐹𝑥) ↔ ∃𝑥𝐴 𝑦 ∈ (𝐹𝑥)))
1410, 11, 133bitr4d 314 . . 3 (𝐹 Fn dom 𝐹 → (𝑦 ∈ (𝐹 𝐴) ↔ 𝑦 𝑥𝐴 (𝐹𝑥)))
1514eqrdv 2763 . 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 2146  wrex 3091   cuni 4874   ciun 4958  ccnv 5662  dom cdm 5663  cima 5666  Fun wfun 6534   Fn wfn 6535  cfv 6540
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 2148  ax-9 2156  ax-10 2179  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-fv 6548
This theorem is used by:  imambfm  34719  dstrvprob  34929
  Copyright terms: Public domain W3C validator