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

Theorem imadiflem 5353
Description: One direction of imadif 5354. 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 2490 . . . 4 (∃𝑥𝐴 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥𝐴𝑥𝐹𝑦))
2 df-rex 2490 . . . . 5 (∃𝑥𝐵 𝑥𝐹𝑦 ↔ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
32notbii 670 . . . 4 (¬ ∃𝑥𝐵 𝑥𝐹𝑦 ↔ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
4 alnex 1522 . . . . . . 7 (∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦) ↔ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦))
5 19.29r 1644 . . . . . . 7 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ∀𝑥 ¬ (𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)))
64, 5sylan2br 288 . . . . . 6 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)))
7 simpl 109 . . . . . . . . 9 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → (𝑥𝐴𝑥𝐹𝑦))
8 simplr 528 . . . . . . . . . 10 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → 𝑥𝐹𝑦)
9 simpr 110 . . . . . . . . . . 11 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → ¬ (𝑥𝐵𝑥𝐹𝑦))
10 ancom 266 . . . . . . . . . . . . 13 ((𝑥𝐵𝑥𝐹𝑦) ↔ (𝑥𝐹𝑦𝑥𝐵))
1110notbii 670 . . . . . . . . . . . 12 (¬ (𝑥𝐵𝑥𝐹𝑦) ↔ ¬ (𝑥𝐹𝑦𝑥𝐵))
12 imnan 692 . . . . . . . . . . . 12 ((𝑥𝐹𝑦 → ¬ 𝑥𝐵) ↔ ¬ (𝑥𝐹𝑦𝑥𝐵))
1311, 12bitr4i 187 . . . . . . . . . . 11 (¬ (𝑥𝐵𝑥𝐹𝑦) ↔ (𝑥𝐹𝑦 → ¬ 𝑥𝐵))
149, 13sylib 122 . . . . . . . . . 10 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → (𝑥𝐹𝑦 → ¬ 𝑥𝐵))
158, 14mpd 13 . . . . . . . . 9 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → ¬ 𝑥𝐵)
167, 15, 8jca32 310 . . . . . . . 8 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → ((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
17 eldif 3175 . . . . . . . . . 10 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴 ∧ ¬ 𝑥𝐵))
1817anbi1i 458 . . . . . . . . 9 ((𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦))
19 anandir 591 . . . . . . . . 9 (((𝑥𝐴 ∧ ¬ 𝑥𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
2018, 19bitri 184 . . . . . . . 8 ((𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦) ↔ ((𝑥𝐴𝑥𝐹𝑦) ∧ (¬ 𝑥𝐵𝑥𝐹𝑦)))
2116, 20sylibr 134 . . . . . . 7 (((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → (𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
2221eximi 1623 . . . . . 6 (∃𝑥((𝑥𝐴𝑥𝐹𝑦) ∧ ¬ (𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
236, 22syl 14 . . . . 5 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
24 df-rex 2490 . . . . 5 (∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦 ↔ ∃𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝑥𝐹𝑦))
2523, 24sylibr 134 . . . 4 ((∃𝑥(𝑥𝐴𝑥𝐹𝑦) ∧ ¬ ∃𝑥(𝑥𝐵𝑥𝐹𝑦)) → ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦)
261, 3, 25syl2anb 291 . . 3 ((∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦) → ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦)
2726ss2abi 3265 . 2 {𝑦 ∣ (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)} ⊆ {𝑦 ∣ ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦}
28 dfima2 5024 . . . 4 (𝐹𝐴) = {𝑦 ∣ ∃𝑥𝐴 𝑥𝐹𝑦}
29 dfima2 5024 . . . 4 (𝐹𝐵) = {𝑦 ∣ ∃𝑥𝐵 𝑥𝐹𝑦}
3028, 29difeq12i 3289 . . 3 ((𝐹𝐴) ∖ (𝐹𝐵)) = ({𝑦 ∣ ∃𝑥𝐴 𝑥𝐹𝑦} ∖ {𝑦 ∣ ∃𝑥𝐵 𝑥𝐹𝑦})
31 difab 3442 . . 3 ({𝑦 ∣ ∃𝑥𝐴 𝑥𝐹𝑦} ∖ {𝑦 ∣ ∃𝑥𝐵 𝑥𝐹𝑦}) = {𝑦 ∣ (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)}
3230, 31eqtri 2226 . 2 ((𝐹𝐴) ∖ (𝐹𝐵)) = {𝑦 ∣ (∃𝑥𝐴 𝑥𝐹𝑦 ∧ ¬ ∃𝑥𝐵 𝑥𝐹𝑦)}
33 dfima2 5024 . 2 (𝐹 “ (𝐴𝐵)) = {𝑦 ∣ ∃𝑥 ∈ (𝐴𝐵)𝑥𝐹𝑦}
3427, 32, 333sstr4i 3234 1 ((𝐹𝐴) ∖ (𝐹𝐵)) ⊆ (𝐹 “ (𝐴𝐵))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wal 1371  wex 1515  wcel 2176  {cab 2191  wrex 2485  cdif 3163  wss 3166   class class class wbr 4044  cima 4678
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-rab 2493  df-v 2774  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-br 4045  df-opab 4106  df-xp 4681  df-cnv 4683  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688
This theorem is referenced by:  imadif  5354
  Copyright terms: Public domain W3C validator