MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  unpreima Structured version   Visualization version   GIF version

Theorem unpreima 7040
Description: Preimage of a union. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
unpreima (Fun 𝐹 → (𝐹 “ (𝐴𝐵)) = ((𝐹𝐴) ∪ (𝐹𝐵)))

Proof of Theorem unpreima
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 funfn 6547 . 2 (Fun 𝐹𝐹 Fn dom 𝐹)
2 elpreima 7035 . . . 4 (𝐹 Fn dom 𝐹 → (𝑥 ∈ (𝐹 “ (𝐴𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ (𝐴𝐵))))
3 elun 4106 . . . . . . 7 ((𝐹𝑥) ∈ (𝐴𝐵) ↔ ((𝐹𝑥) ∈ 𝐴 ∨ (𝐹𝑥) ∈ 𝐵))
43anbi2i 632 . . . . . 6 ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ (𝐴𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ ((𝐹𝑥) ∈ 𝐴 ∨ (𝐹𝑥) ∈ 𝐵)))
5 andi 1020 . . . . . 6 ((𝑥 ∈ dom 𝐹 ∧ ((𝐹𝑥) ∈ 𝐴 ∨ (𝐹𝑥) ∈ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵)))
64, 5bitri 277 . . . . 5 ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ (𝐴𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵)))
7 elun 4106 . . . . . 6 (𝑥 ∈ ((𝐹𝐴) ∪ (𝐹𝐵)) ↔ (𝑥 ∈ (𝐹𝐴) ∨ 𝑥 ∈ (𝐹𝐵)))
8 elpreima 7035 . . . . . . 7 (𝐹 Fn dom 𝐹 → (𝑥 ∈ (𝐹𝐴) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴)))
9 elpreima 7035 . . . . . . 7 (𝐹 Fn dom 𝐹 → (𝑥 ∈ (𝐹𝐵) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵)))
108, 9orbi12d 929 . . . . . 6 (𝐹 Fn dom 𝐹 → ((𝑥 ∈ (𝐹𝐴) ∨ 𝑥 ∈ (𝐹𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵))))
117, 10bitrid 285 . . . . 5 (𝐹 Fn dom 𝐹 → (𝑥 ∈ ((𝐹𝐴) ∪ (𝐹𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵))))
126, 11bitr4id 292 . . . 4 (𝐹 Fn dom 𝐹 → ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ (𝐴𝐵)) ↔ 𝑥 ∈ ((𝐹𝐴) ∪ (𝐹𝐵))))
132, 12bitrd 281 . . 3 (𝐹 Fn dom 𝐹 → (𝑥 ∈ (𝐹 “ (𝐴𝐵)) ↔ 𝑥 ∈ ((𝐹𝐴) ∪ (𝐹𝐵))))
1413eqrdv 2759 . 2 (𝐹 Fn dom 𝐹 → (𝐹 “ (𝐴𝐵)) = ((𝐹𝐴) ∪ (𝐹𝐵)))
151, 14sylbi 219 1 (Fun 𝐹 → (𝐹 “ (𝐴𝐵)) = ((𝐹𝐴) ∪ (𝐹𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  wo 858   = wceq 1559  wcel 2141  cun 3902  ccnv 5644  dom cdm 5645  cima 5648  Fun wfun 6511   Fn wfn 6512  cfv 6517
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pr 5389
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-fv 6525
This theorem is referenced by:  sibfof  34598
  Copyright terms: Public domain W3C validator