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

Theorem imadif 6502
Description: The image of a difference is the difference of images. (Contributed by NM, 24-May-1998.)
Assertion
Ref Expression
imadif (Fun 𝐹 → (𝐹 “ (𝐴𝐵)) = ((𝐹𝐴) ∖ (𝐹𝐵)))

Proof of Theorem imadif
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 anandir 673 . . . . . . . 8 (((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
21exbii 1851 . . . . . . 7 (∃𝑥((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) ↔ ∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
3 19.40 1890 . . . . . . 7 (∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)) → (∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ∃𝑥𝑥𝐵𝑥𝐹𝑦)))
42, 3sylbi 216 . . . . . 6 (∃𝑥((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) → (∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ∃𝑥𝑥𝐵𝑥𝐹𝑦)))
5 nfv 1918 . . . . . . . . . . 11 𝑥Fun 𝐹
6 nfe1 2149 . . . . . . . . . . 11 𝑥𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵)
75, 6nfan 1903 . . . . . . . . . 10 𝑥(Fun 𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵))
8 funmo 6434 . . . . . . . . . . . . . 14 (Fun 𝐹 → ∃*𝑥 𝑦𝐹𝑥)
9 vex 3426 . . . . . . . . . . . . . . . 16 𝑦 ∈ V
10 vex 3426 . . . . . . . . . . . . . . . 16 𝑥 ∈ V
119, 10brcnv 5780 . . . . . . . . . . . . . . 15 (𝑦𝐹𝑥𝑥𝐹𝑦)
1211mobii 2548 . . . . . . . . . . . . . 14 (∃*𝑥 𝑦𝐹𝑥 ↔ ∃*𝑥 𝑥𝐹𝑦)
138, 12sylib 217 . . . . . . . . . . . . 13 (Fun 𝐹 → ∃*𝑥 𝑥𝐹𝑦)
14 mopick 2627 . . . . . . . . . . . . 13 ((∃*𝑥 𝑥𝐹𝑦 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵)) → (𝑥𝐹𝑦 → ¬ 𝑥𝐵))
1513, 14sylan 579 . . . . . . . . . . . 12 ((Fun 𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵)) → (𝑥𝐹𝑦 → ¬ 𝑥𝐵))
1615con2d 134 . . . . . . . . . . 11 ((Fun 𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵)) → (𝑥𝐵 → ¬ 𝑥𝐹𝑦))
17 imnan 399 . . . . . . . . . . 11 ((𝑥𝐵 → ¬ 𝑥𝐹𝑦) ↔ ¬ (𝑥𝐵𝑥𝐹𝑦))
1816, 17sylib 217 . . . . . . . . . 10 ((Fun 𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵)) → ¬ (𝑥𝐵𝑥𝐹𝑦))
197, 18alrimi 2209 . . . . . . . . 9 ((Fun 𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵)) → ∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦))
2019ex 412 . . . . . . . 8 (Fun 𝐹 → (∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵) → ∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦)))
21 exancom 1865 . . . . . . . 8 (∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵) ↔ ∃𝑥𝑥𝐵𝑥𝐹𝑦))
22 alnex 1785 . . . . . . . 8 (∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦) ↔ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
2320, 21, 223imtr3g 294 . . . . . . 7 (Fun 𝐹 → (∃𝑥𝑥𝐵𝑥𝐹𝑦) → ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)))
2423anim2d 611 . . . . . 6 (Fun 𝐹 → ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ∃𝑥𝑥𝐵𝑥𝐹𝑦)) → (∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))))
254, 24syl5 34 . . . . 5 (Fun 𝐹 → (∃𝑥((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) → (∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))))
26 19.29r 1878 . . . . . . 7 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)))
2722, 26sylan2br 594 . . . . . 6 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)))
28 andi 1004 . . . . . . . 8 (((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵 ∨ ¬ 𝑥𝐹𝑦)) ↔ (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ 𝑥𝐵) ∨ ((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ 𝑥𝐹𝑦)))
29 ianor 978 . . . . . . . . 9 (¬ (𝑥𝐵𝑥𝐹𝑦) ↔ (¬ 𝑥𝐵 ∨ ¬ 𝑥𝐹𝑦))
3029anbi2i 622 . . . . . . . 8 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) ↔ ((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵 ∨ ¬ 𝑥𝐹𝑦)))
31 an32 642 . . . . . . . . 9 (((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ 𝑥𝐵))
32 pm3.24 402 . . . . . . . . . . . 12 ¬ (𝑥𝐹𝑦 ∧ ¬ 𝑥𝐹𝑦)
3332intnan 486 . . . . . . . . . . 11 ¬ (𝑥𝐴 ∧ (𝑥𝐹𝑦 ∧ ¬ 𝑥𝐹𝑦))
34 anass 468 . . . . . . . . . . 11 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ 𝑥𝐹𝑦) ↔ (𝑥𝐴 ∧ (𝑥𝐹𝑦 ∧ ¬ 𝑥𝐹𝑦)))
3533, 34mtbir 322 . . . . . . . . . 10 ¬ ((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ 𝑥𝐹𝑦)
3635biorfi 935 . . . . . . . . 9 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ 𝑥𝐵) ↔ (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ 𝑥𝐵) ∨ ((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ 𝑥𝐹𝑦)))
3731, 36bitri 274 . . . . . . . 8 (((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) ↔ (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ 𝑥𝐵) ∨ ((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ 𝑥𝐹𝑦)))
3828, 30, 373bitr4i 302 . . . . . . 7 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) ↔ ((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦))
3938exbii 1851 . . . . . 6 (∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) ↔ ∃𝑥((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦))
4027, 39sylib 217 . . . . 5 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦))
4125, 40impbid1 224 . . . 4 (Fun 𝐹 → (∃𝑥((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) ↔ (∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))))
42 eldif 3893 . . . . . 6 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴 ∧ ¬ 𝑥𝐵))
4342anbi1i 623 . . . . 5 ((𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦))
4443exbii 1851 . . . 4 (∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦) ↔ ∃𝑥((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦))
459elima2 5964 . . . . 5 (𝑦 ∈ (𝐹𝐴) ↔ ∃𝑥(𝑥𝐴𝑥𝐹𝑦))
469elima2 5964 . . . . . 6 (𝑦 ∈ (𝐹𝐵) ↔ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
4746notbii 319 . . . . 5 𝑦 ∈ (𝐹𝐵) ↔ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
4845, 47anbi12i 626 . . . 4 ((𝑦 ∈ (𝐹𝐴) ∧ ¬ 𝑦 ∈ (𝐹𝐵)) ↔ (∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)))
4941, 44, 483bitr4g 313 . . 3 (Fun 𝐹 → (∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦) ↔ (𝑦 ∈ (𝐹𝐴) ∧ ¬ 𝑦 ∈ (𝐹𝐵))))
509elima2 5964 . . 3 (𝑦 ∈ (𝐹 “ (𝐴𝐵)) ↔ ∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
51 eldif 3893 . . 3 (𝑦 ∈ ((𝐹𝐴) ∖ (𝐹𝐵)) ↔ (𝑦 ∈ (𝐹𝐴) ∧ ¬ 𝑦 ∈ (𝐹𝐵)))
5249, 50, 513bitr4g 313 . 2 (Fun 𝐹 → (𝑦 ∈ (𝐹 “ (𝐴𝐵)) ↔ 𝑦 ∈ ((𝐹𝐴) ∖ (𝐹𝐵))))
5352eqrdv 2736 1 (Fun 𝐹 → (𝐹 “ (𝐴𝐵)) = ((𝐹𝐴) ∖ (𝐹𝐵)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wo 843  wal 1537   = wceq 1539  wex 1783  wcel 2108  ∃*wmo 2538  cdif 3880   class class class wbr 5070  ccnv 5579  cima 5583  Fun wfun 6412
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-fun 6420
This theorem is referenced by:  imain  6503  resdif  6720  difpreima  6924  domunsncan  8812  phplem4  8895  php3  8899  infdifsn  9345  cantnfp1lem3  9368  enfin1ai  10071  fin1a2lem7  10093  symgfixelsi  18958  dprdf1o  19550  frlmlbs  20914  f1lindf  20939  cnclima  22327  iscncl  22328  qtopcld  22772  qtoprest  22776  qtopcmap  22778  mbfimaicc  24700  ismbf3d  24723  i1fd  24750  ballotlemfrc  32393  poimirlem2  35706  poimirlem4  35708  poimirlem6  35710  poimirlem7  35711  poimirlem9  35713  poimirlem11  35715  poimirlem12  35716  poimirlem13  35717  poimirlem14  35718  poimirlem16  35720  poimirlem19  35723  poimirlem23  35727
  Copyright terms: Public domain W3C validator