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

Theorem imadiflem 4998
Description: One direction of imadif 4999. 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 2354 . . . 4 (∃𝑥𝐴 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥𝐴𝑥𝐹𝑦))
2 df-rex 2354 . . . . 5 (∃𝑥𝐵 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
32notbii 626 . . . 4 (¬ ∃𝑥𝐵 𝑥𝐹𝑦 ↔ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
4 alnex 1428 . . . . . . 7 (∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦) ↔ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
5 19.29r 1552 . . . . . . 7 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)))
64, 5sylan2br 282 . . . . . 6 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)))
7 simpl 107 . . . . . . . . 9 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → (𝑥𝐴𝑥𝐹𝑦))
8 simplr 496 . . . . . . . . . 10 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → 𝑥𝐹𝑦)
9 simpr 108 . . . . . . . . . . 11 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → ¬ (𝑥𝐵𝑥𝐹𝑦))
10 ancom 262 . . . . . . . . . . . . 13 ((𝑥𝐵𝑥𝐹𝑦) ↔ (𝑥𝐹𝑦𝑥𝐵))
1110notbii 626 . . . . . . . . . . . 12 (¬ (𝑥𝐵𝑥𝐹𝑦) ↔ ¬ (𝑥𝐹𝑦𝑥𝐵))
12 imnan 656 . . . . . . . . . . . 12 ((𝑥𝐹𝑦 → ¬ 𝑥𝐵) ↔ ¬ (𝑥𝐹𝑦𝑥𝐵))
1311, 12bitr4i 185 . . . . . . . . . . 11 (¬ (𝑥𝐵𝑥𝐹𝑦) ↔ (𝑥𝐹𝑦 → ¬ 𝑥𝐵))
149, 13sylib 120 . . . . . . . . . 10 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → (𝑥𝐹𝑦 → ¬ 𝑥𝐵))
158, 14mpd 13 . . . . . . . . 9 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → ¬ 𝑥𝐵)
167, 15, 8jca32 303 . . . . . . . 8 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → ((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
17 eldif 2982 . . . . . . . . . 10 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴 ∧ ¬ 𝑥𝐵))
1817anbi1i 445 . . . . . . . . 9 ((𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦))
19 anandir 555 . . . . . . . . 9 (((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
2018, 19bitri 182 . . . . . . . 8 ((𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
2116, 20sylibr 132 . . . . . . 7 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → (𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
2221eximi 1531 . . . . . 6 (∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
236, 22syl 14 . . . . 5 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
24 df-rex 2354 . . . . 5 (∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦 ↔ ∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
2523, 24sylibr 132 . . . 4 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦)
261, 3, 25syl2anb 285 . . 3 ((∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦) → ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦)
2726ss2abi 3066 . 2 {𝑦 ∣ (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)} ⊆ {𝑦 ∣ ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦}
28 dfima2 4690 . . . 4 (𝐹𝐴) = {𝑦 ∣ ∃𝑥𝐴 𝑥𝐹𝑦}
29 dfima2 4690 . . . 4 (𝐹𝐵) = {𝑦 ∣ ∃𝑥𝐵 𝑥𝐹𝑦}
3028, 29difeq12i 3088 . . 3 ((𝐹𝐴) ∖ (𝐹𝐵)) = ({𝑦 ∣ ∃𝑥𝐴 𝑥𝐹𝑦} ∖ {𝑦 ∣ ∃𝑥𝐵 𝑥𝐹𝑦})
31 difab 3233 . . 3 ({𝑦 ∣ ∃𝑥𝐴 𝑥𝐹𝑦} ∖ {𝑦 ∣ ∃𝑥𝐵 𝑥𝐹𝑦}) = {𝑦 ∣ (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)}
3230, 31eqtri 2101 . 2 ((𝐹𝐴) ∖ (𝐹𝐵)) = {𝑦 ∣ (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)}
33 dfima2 4690 . 2 (𝐹 “ (𝐴𝐵)) = {𝑦 ∣ ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦}
3427, 32, 333sstr4i 3038 1 ((𝐹𝐴) ∖ (𝐹𝐵)) ⊆ (𝐹 “ (𝐴𝐵))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 102  wal 1282  wex 1421  wcel 1433  {cab 2067  wrex 2349  cdif 2970  wss 2973   class class class wbr 3785  cima 4366
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-rab 2357  df-v 2603  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-xp 4369  df-cnv 4371  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376
This theorem is referenced by:  imadif  4999
  Copyright terms: Public domain W3C validator