ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  imadif GIF version

Theorem imadif 4979
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 525 . . . . . . . 8 (((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
21exbii 1496 . . . . . . 7 (∃𝑥((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) ↔ ∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
3 19.40 1522 . . . . . . 7 (∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)) → (∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ∃𝑥𝑥𝐵𝑥𝐹𝑦)))
42, 3sylbi 114 . . . . . 6 (∃𝑥((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) → (∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ∃𝑥𝑥𝐵𝑥𝐹𝑦)))
5 nfv 1421 . . . . . . . . . . 11 𝑥Fun 𝐹
6 nfe1 1385 . . . . . . . . . . 11 𝑥𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵)
75, 6nfan 1457 . . . . . . . . . 10 𝑥(Fun 𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵))
8 funmo 4917 . . . . . . . . . . . . . 14 (Fun 𝐹 → ∃*𝑥 𝑦𝐹𝑥)
9 vex 2560 . . . . . . . . . . . . . . . 16 𝑦 ∈ V
10 vex 2560 . . . . . . . . . . . . . . . 16 𝑥 ∈ V
119, 10brcnv 4518 . . . . . . . . . . . . . . 15 (𝑦𝐹𝑥𝑥𝐹𝑦)
1211mobii 1937 . . . . . . . . . . . . . 14 (∃*𝑥 𝑦𝐹𝑥 ↔ ∃*𝑥 𝑥𝐹𝑦)
138, 12sylib 127 . . . . . . . . . . . . 13 (Fun 𝐹 → ∃*𝑥 𝑥𝐹𝑦)
14 mopick 1978 . . . . . . . . . . . . 13 ((∃*𝑥 𝑥𝐹𝑦 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵)) → (𝑥𝐹𝑦 → ¬ 𝑥𝐵))
1513, 14sylan 267 . . . . . . . . . . . 12 ((Fun 𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵)) → (𝑥𝐹𝑦 → ¬ 𝑥𝐵))
1615con2d 554 . . . . . . . . . . 11 ((Fun 𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵)) → (𝑥𝐵 → ¬ 𝑥𝐹𝑦))
17 imnan 624 . . . . . . . . . . 11 ((𝑥𝐵 → ¬ 𝑥𝐹𝑦) ↔ ¬ (𝑥𝐵𝑥𝐹𝑦))
1816, 17sylib 127 . . . . . . . . . 10 ((Fun 𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵)) → ¬ (𝑥𝐵𝑥𝐹𝑦))
197, 18alrimi 1415 . . . . . . . . 9 ((Fun 𝐹 ∧ ∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵)) → ∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦))
2019ex 108 . . . . . . . 8 (Fun 𝐹 → (∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵) → ∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦)))
21 exancom 1499 . . . . . . . 8 (∃𝑥(𝑥𝐹𝑦 ∧ ¬ 𝑥𝐵) ↔ ∃𝑥𝑥𝐵𝑥𝐹𝑦))
22 alnex 1388 . . . . . . . 8 (∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦) ↔ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
2320, 21, 223imtr3g 193 . . . . . . 7 (Fun 𝐹 → (∃𝑥𝑥𝐵𝑥𝐹𝑦) → ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)))
2423anim2d 320 . . . . . 6 (Fun 𝐹 → ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ∃𝑥𝑥𝐵𝑥𝐹𝑦)) → (∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))))
254, 24syl5 28 . . . . 5 (Fun 𝐹 → (∃𝑥((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) → (∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))))
26 df-rex 2312 . . . . . 6 (∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦 ↔ ∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
27 eldif 2927 . . . . . . . 8 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴 ∧ ¬ 𝑥𝐵))
2827anbi1i 431 . . . . . . 7 ((𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦))
2928exbii 1496 . . . . . 6 (∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦) ↔ ∃𝑥((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦))
3026, 29bitri 173 . . . . 5 (∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦 ↔ ∃𝑥((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦))
31 df-rex 2312 . . . . . 6 (∃𝑥𝐴 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥𝐴𝑥𝐹𝑦))
32 df-rex 2312 . . . . . . 7 (∃𝑥𝐵 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
3332notbii 594 . . . . . 6 (¬ ∃𝑥𝐵 𝑥𝐹𝑦 ↔ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
3431, 33anbi12i 433 . . . . 5 ((∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦) ↔ (∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)))
3525, 30, 343imtr4g 194 . . . 4 (Fun 𝐹 → (∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦 → (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)))
3635ss2abdv 3013 . . 3 (Fun 𝐹 → {𝑦 ∣ ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦} ⊆ {𝑦 ∣ (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)})
37 dfima2 4670 . . 3 (𝐹 “ (𝐴𝐵)) = {𝑦 ∣ ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦}
38 dfima2 4670 . . . . 5 (𝐹𝐴) = {𝑦 ∣ ∃𝑥𝐴 𝑥𝐹𝑦}
39 dfima2 4670 . . . . 5 (𝐹𝐵) = {𝑦 ∣ ∃𝑥𝐵 𝑥𝐹𝑦}
4038, 39difeq12i 3060 . . . 4 ((𝐹𝐴) ∖ (𝐹𝐵)) = ({𝑦 ∣ ∃𝑥𝐴 𝑥𝐹𝑦} ∖ {𝑦 ∣ ∃𝑥𝐵 𝑥𝐹𝑦})
41 difab 3206 . . . 4 ({𝑦 ∣ ∃𝑥𝐴 𝑥𝐹𝑦} ∖ {𝑦 ∣ ∃𝑥𝐵 𝑥𝐹𝑦}) = {𝑦 ∣ (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)}
4240, 41eqtri 2060 . . 3 ((𝐹𝐴) ∖ (𝐹𝐵)) = {𝑦 ∣ (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)}
4336, 37, 423sstr4g 2986 . 2 (Fun 𝐹 → (𝐹 “ (𝐴𝐵)) ⊆ ((𝐹𝐴) ∖ (𝐹𝐵)))
44 imadiflem 4978 . . 3 ((𝐹𝐴) ∖ (𝐹𝐵)) ⊆ (𝐹 “ (𝐴𝐵))
4544a1i 9 . 2 (Fun 𝐹 → ((𝐹𝐴) ∖ (𝐹𝐵)) ⊆ (𝐹 “ (𝐴𝐵)))
4643, 45eqssd 2962 1 (Fun 𝐹 → (𝐹 “ (𝐴𝐵)) = ((𝐹𝐴) ∖ (𝐹𝐵)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 97  wal 1241   = wceq 1243  wex 1381  wcel 1393  ∃*wmo 1901  {cab 2026  wrex 2307  cdif 2914  wss 2917   class class class wbr 3764  ccnv 4344  cima 4348  Fun wfun 4896
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-rab 2315  df-v 2559  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-br 3765  df-opab 3819  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-fun 4904
This theorem is referenced by:  resdif  5148  difpreima  5294  phplem4  6318  phplem4dom  6324  phplem4on  6329
  Copyright terms: Public domain W3C validator