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

Theorem imadiflem 5267
Description: One direction of imadif 5268. This direction does not require Fun 𝐹. (Contributed by Jim Kingdon, 25-Dec-2018.)
Assertion
Ref Expression
imadiflem ((𝐹𝐴) ∖ (𝐹𝐵)) ⊆ (𝐹 “ (𝐴𝐵))

Proof of Theorem imadiflem
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-rex 2450 . . . 4 (∃𝑥𝐴 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥𝐴𝑥𝐹𝑦))
2 df-rex 2450 . . . . 5 (∃𝑥𝐵 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
32notbii 658 . . . 4 (¬ ∃𝑥𝐵 𝑥𝐹𝑦 ↔ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
4 alnex 1487 . . . . . . 7 (∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦) ↔ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
5 19.29r 1609 . . . . . . 7 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)))
64, 5sylan2br 286 . . . . . 6 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)))
7 simpl 108 . . . . . . . . 9 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → (𝑥𝐴𝑥𝐹𝑦))
8 simplr 520 . . . . . . . . . 10 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → 𝑥𝐹𝑦)
9 simpr 109 . . . . . . . . . . 11 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → ¬ (𝑥𝐵𝑥𝐹𝑦))
10 ancom 264 . . . . . . . . . . . . 13 ((𝑥𝐵𝑥𝐹𝑦) ↔ (𝑥𝐹𝑦𝑥𝐵))
1110notbii 658 . . . . . . . . . . . 12 (¬ (𝑥𝐵𝑥𝐹𝑦) ↔ ¬ (𝑥𝐹𝑦𝑥𝐵))
12 imnan 680 . . . . . . . . . . . 12 ((𝑥𝐹𝑦 → ¬ 𝑥𝐵) ↔ ¬ (𝑥𝐹𝑦𝑥𝐵))
1311, 12bitr4i 186 . . . . . . . . . . 11 (¬ (𝑥𝐵𝑥𝐹𝑦) ↔ (𝑥𝐹𝑦 → ¬ 𝑥𝐵))
149, 13sylib 121 . . . . . . . . . 10 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → (𝑥𝐹𝑦 → ¬ 𝑥𝐵))
158, 14mpd 13 . . . . . . . . 9 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → ¬ 𝑥𝐵)
167, 15, 8jca32 308 . . . . . . . 8 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → ((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
17 eldif 3125 . . . . . . . . . 10 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴 ∧ ¬ 𝑥𝐵))
1817anbi1i 454 . . . . . . . . 9 ((𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦))
19 anandir 581 . . . . . . . . 9 (((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
2018, 19bitri 183 . . . . . . . 8 ((𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
2116, 20sylibr 133 . . . . . . 7 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → (𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
2221eximi 1588 . . . . . 6 (∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
236, 22syl 14 . . . . 5 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
24 df-rex 2450 . . . . 5 (∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦 ↔ ∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
2523, 24sylibr 133 . . . 4 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦)
261, 3, 25syl2anb 289 . . 3 ((∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦) → ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦)
2726ss2abi 3214 . 2 {𝑦 ∣ (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)} ⊆ {𝑦 ∣ ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦}
28 dfima2 4948 . . . 4 (𝐹𝐴) = {𝑦 ∣ ∃𝑥𝐴 𝑥𝐹𝑦}
29 dfima2 4948 . . . 4 (𝐹𝐵) = {𝑦 ∣ ∃𝑥𝐵 𝑥𝐹𝑦}
3028, 29difeq12i 3238 . . 3 ((𝐹𝐴) ∖ (𝐹𝐵)) = ({𝑦 ∣ ∃𝑥𝐴 𝑥𝐹𝑦} ∖ {𝑦 ∣ ∃𝑥𝐵 𝑥𝐹𝑦})
31 difab 3391 . . 3 ({𝑦 ∣ ∃𝑥𝐴 𝑥𝐹𝑦} ∖ {𝑦 ∣ ∃𝑥𝐵 𝑥𝐹𝑦}) = {𝑦 ∣ (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)}
3230, 31eqtri 2186 . 2 ((𝐹𝐴) ∖ (𝐹𝐵)) = {𝑦 ∣ (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)}
33 dfima2 4948 . 2 (𝐹 “ (𝐴𝐵)) = {𝑦 ∣ ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦}
3427, 32, 333sstr4i 3183 1 ((𝐹𝐴) ∖ (𝐹𝐵)) ⊆ (𝐹 “ (𝐴𝐵))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wal 1341  wex 1480  wcel 2136  {cab 2151  wrex 2445  cdif 3113  wss 3116   class class class wbr 3982  cima 4607
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-br 3983  df-opab 4044  df-xp 4610  df-cnv 4612  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617
This theorem is referenced by:  imadif  5268
  Copyright terms: Public domain W3C validator