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

Theorem unpreima 6381
 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 5956 . 2 (Fun 𝐹𝐹 Fn dom 𝐹)
2 elpreima 6377 . . . 4 (𝐹 Fn dom 𝐹 → (𝑥 ∈ (𝐹 “ (𝐴𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ (𝐴𝐵))))
3 elun 3786 . . . . . 6 (𝑥 ∈ ((𝐹𝐴) ∪ (𝐹𝐵)) ↔ (𝑥 ∈ (𝐹𝐴) ∨ 𝑥 ∈ (𝐹𝐵)))
4 elpreima 6377 . . . . . . 7 (𝐹 Fn dom 𝐹 → (𝑥 ∈ (𝐹𝐴) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴)))
5 elpreima 6377 . . . . . . 7 (𝐹 Fn dom 𝐹 → (𝑥 ∈ (𝐹𝐵) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵)))
64, 5orbi12d 746 . . . . . 6 (𝐹 Fn dom 𝐹 → ((𝑥 ∈ (𝐹𝐴) ∨ 𝑥 ∈ (𝐹𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵))))
73, 6syl5bb 272 . . . . 5 (𝐹 Fn dom 𝐹 → (𝑥 ∈ ((𝐹𝐴) ∪ (𝐹𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵))))
8 elun 3786 . . . . . . 7 ((𝐹𝑥) ∈ (𝐴𝐵) ↔ ((𝐹𝑥) ∈ 𝐴 ∨ (𝐹𝑥) ∈ 𝐵))
98anbi2i 730 . . . . . 6 ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ (𝐴𝐵)) ↔ (𝑥 ∈ dom 𝐹 ∧ ((𝐹𝑥) ∈ 𝐴 ∨ (𝐹𝑥) ∈ 𝐵)))
10 andi 929 . . . . . 6 ((𝑥 ∈ dom 𝐹 ∧ ((𝐹𝑥) ∈ 𝐴 ∨ (𝐹𝑥) ∈ 𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵)))
119, 10bitri 264 . . . . 5 ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ (𝐴𝐵)) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐴) ∨ (𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ 𝐵)))
127, 11syl6rbbr 279 . . . 4 (𝐹 Fn dom 𝐹 → ((𝑥 ∈ dom 𝐹 ∧ (𝐹𝑥) ∈ (𝐴𝐵)) ↔ 𝑥 ∈ ((𝐹𝐴) ∪ (𝐹𝐵))))
132, 12bitrd 268 . . 3 (𝐹 Fn dom 𝐹 → (𝑥 ∈ (𝐹 “ (𝐴𝐵)) ↔ 𝑥 ∈ ((𝐹𝐴) ∪ (𝐹𝐵))))
1413eqrdv 2649 . 2 (𝐹 Fn dom 𝐹 → (𝐹 “ (𝐴𝐵)) = ((𝐹𝐴) ∪ (𝐹𝐵)))
151, 14sylbi 207 1 (Fun 𝐹 → (𝐹 “ (𝐴𝐵)) = ((𝐹𝐴) ∪ (𝐹𝐵)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∨ wo 382   ∧ wa 383   = wceq 1523   ∈ wcel 2030   ∪ cun 3605  ◡ccnv 5142  dom cdm 5143   “ cima 5146  Fun wfun 5920   Fn wfn 5921  ‘cfv 5926 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-iota 5889  df-fun 5928  df-fn 5929  df-fv 5934 This theorem is referenced by:  sibfof  30530
 Copyright terms: Public domain W3C validator