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 33117
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 6564 . 2 (Fun 𝐹𝐹 Fn dom 𝐹)
2 r19.42v 3194 . . . . . . 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 7051 . . . . . 6 (𝐹 Fn dom 𝐹 → (𝑦 ∈ (𝐹𝑥) ↔ (𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝑥)))
98rexbidv 3186 . . . . 5 (𝐹 Fn dom 𝐹 → (∃𝑥𝐴 𝑦 ∈ (𝐹𝑥) ↔ ∃𝑥𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝑥)))
104, 7, 93bitr4d 314 . . . 4 (𝐹 Fn dom 𝐹 → ((𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝐴) ↔ ∃𝑥𝐴 𝑦 ∈ (𝐹𝑥)))
11 elpreima 7051 . . . 4 (𝐹 Fn dom 𝐹 → (𝑦 ∈ (𝐹 𝐴) ↔ (𝑦 ∈ dom 𝐹 ∧ (𝐹𝑦) ∈ 𝐴)))
12 eliun 4955 . . . . 5 (𝑦 𝑥𝐴 (𝐹𝑥) ↔ ∃𝑥𝐴 𝑦 ∈ (𝐹𝑥))
1312a1i 11 . . . 4 (𝐹 Fn dom 𝐹 → (𝑦 𝑥𝐴 (𝐹𝑥) ↔ ∃𝑥𝐴 𝑦 ∈ (𝐹𝑥)))
1410, 11, 133bitr4d 314 . . 3 (𝐹 Fn dom 𝐹 → (𝑦 ∈ (𝐹 𝐴) ↔ 𝑦 𝑥𝐴 (𝐹𝑥)))
1514eqrdv 2758 . 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 3086   cuni 4867   ciun 4951  ccnv 5654  dom cdm 5655  cima 5658  Fun wfun 6527   Fn wfn 6528  cfv 6533
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 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  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 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-fv 6541
This theorem is used by:  imambfm  34774  dstrvprob  34984
  Copyright terms: Public domain W3C validator