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 33335
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 6598 . 2 (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
2 r19.42v 3198 . . . . . . 7 (∃𝑥 ∈ 𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ 𝑥) ↔ (𝑦 ∈ dom 𝐹 ∧ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝑥))
32bicomi 227 . . . . . 6 ((𝑦 ∈ dom 𝐹 ∧ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝑥) ↔ ∃𝑥 ∈ 𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ 𝑥))
43a1i 11 . . . . 5 (𝐹 Fn dom 𝐹 → ((𝑦 ∈ dom 𝐹 ∧ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝑥) ↔ ∃𝑥 ∈ 𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ 𝑥)))
5 eluni2 4876 . . . . . . 7 ((𝐹‘𝑦) ∈ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝑥)
65anbi2i 635 . . . . . 6 ((𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ ∪ 𝐴) ↔ (𝑦 ∈ dom 𝐹 ∧ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝑥))
76a1i 11 . . . . 5 (𝐹 Fn dom 𝐹 → ((𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ ∪ 𝐴) ↔ (𝑦 ∈ dom 𝐹 ∧ ∃𝑥 ∈ 𝐴 (𝐹‘𝑦) ∈ 𝑥)))
8 elpreima 7088 . . . . . 6 (𝐹 Fn dom 𝐹 → (𝑦 ∈ (◡𝐹 “ 𝑥) ↔ (𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ 𝑥)))
98rexbidv 3190 . . . . 5 (𝐹 Fn dom 𝐹 → (∃𝑥 ∈ 𝐴 𝑦 ∈ (◡𝐹 “ 𝑥) ↔ ∃𝑥 ∈ 𝐴 (𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ 𝑥)))
104, 7, 93bitr4d 314 . . . 4 (𝐹 Fn dom 𝐹 → ((𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ ∪ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ (◡𝐹 “ 𝑥)))
11 elpreima 7088 . . . 4 (𝐹 Fn dom 𝐹 → (𝑦 ∈ (◡𝐹 “ ∪ 𝐴) ↔ (𝑦 ∈ dom 𝐹 ∧ (𝐹‘𝑦) ∈ ∪ 𝐴)))
12 eliun 4960 . . . . 5 (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (◡𝐹 “ 𝑥) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ (◡𝐹 “ 𝑥))
1312a1i 11 . . . 4 (𝐹 Fn dom 𝐹 → (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (◡𝐹 “ 𝑥) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ (◡𝐹 “ 𝑥)))
1410, 11, 133bitr4d 314 . . 3 (𝐹 Fn dom 𝐹 → (𝑦 ∈ (◡𝐹 “ ∪ 𝐴) ↔ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (◡𝐹 “ 𝑥)))
1514eqrdv 2761 . 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 2147  ∃wrex 3090  ∪ cuni 4872  ∪ ciun 4956  ◡ccnv 5657  dom cdm 5658   “ cima 5661  Fun wfun 6560   Fn wfn 6561  ‘cfv 6566
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-fv 6574
This theorem is used by:  imambfm  35005  dstrvprob  35215
  Copyright terms: Public domain W3C validator