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

Theorem unpreima 7009
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 6522 . 2 (Fun 𝐹𝐹 Fn dom 𝐹)
2 elpreima 7004 . . . 4 (𝐹 Fn dom 𝐹 → (𝑥 ∈ (𝐹 “ (𝐴𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ (𝐴𝐵))))
3 elun 4094 . . . . . . 7 ((𝐹𝑥) ∈ (𝐴𝐵) ↔ ((𝐹𝑥) ∈ 𝐴 ∨ (𝐹𝑥) ∈ 𝐵))
43anbi2i 624 . . . . . 6 ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ (𝐴𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ ((𝐹𝑥) ∈ 𝐴 ∨ (𝐹𝑥) ∈ 𝐵)))
5 andi 1010 . . . . . 6 ((𝑥 ∈ dom 𝐹 ∧ ((𝐹𝑥) ∈ 𝐴 ∨ (𝐹𝑥) ∈ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵)))
64, 5bitri 275 . . . . 5 ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ (𝐴𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵)))
7 elun 4094 . . . . . 6 (𝑥 ∈ ((𝐹𝐴) ∪ (𝐹𝐵)) ↔ (𝑥 ∈ (𝐹𝐴) ∨ 𝑥 ∈ (𝐹𝐵)))
8 elpreima 7004 . . . . . . 7 (𝐹 Fn dom 𝐹 → (𝑥 ∈ (𝐹𝐴) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴)))
9 elpreima 7004 . . . . . . 7 (𝐹 Fn dom 𝐹 → (𝑥 ∈ (𝐹𝐵) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵)))
108, 9orbi12d 919 . . . . . 6 (𝐹 Fn dom 𝐹 → ((𝑥 ∈ (𝐹𝐴) ∨ 𝑥 ∈ (𝐹𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵))))
117, 10bitrid 283 . . . . 5 (𝐹 Fn dom 𝐹 → (𝑥 ∈ ((𝐹𝐴) ∪ (𝐹𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵))))
126, 11bitr4id 290 . . . 4 (𝐹 Fn dom 𝐹 → ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ (𝐴𝐵)) ↔ 𝑥 ∈ ((𝐹𝐴) ∪ (𝐹𝐵))))
132, 12bitrd 279 . . 3 (𝐹 Fn dom 𝐹 → (𝑥 ∈ (𝐹 “ (𝐴𝐵)) ↔ 𝑥 ∈ ((𝐹𝐴) ∪ (𝐹𝐵))))
1413eqrdv 2735 . 2 (𝐹 Fn dom 𝐹 → (𝐹 “ (𝐴𝐵)) = ((𝐹𝐴) ∪ (𝐹𝐵)))
151, 14sylbi 217 1 (Fun 𝐹 → (𝐹 “ (𝐴𝐵)) = ((𝐹𝐴) ∪ (𝐹𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 848   = wceq 1542  wcel 2114  cun 3888  ccnv 5623  dom cdm 5624  cima 5627  Fun wfun 6486   Fn wfn 6487  cfv 6492
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pr 5370
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-fv 6500
This theorem is referenced by:  sibfof  34500
  Copyright terms: Public domain W3C validator