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

Theorem inssdif0OLD 4329
Description: Obsolete version of inssdif0 4328 as of 18-Jul-2026. (Contributed by NM, 27-Oct-1996.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) (Proof shortened by Wolf Lammen, 30-Sep-2014.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
inssdif0OLD ((𝐴𝐵) ⊆ 𝐶 ↔ (𝐴 ∩ (𝐵𝐶)) = ∅)

Proof of Theorem inssdif0OLD
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elin 3920 . . . . . 6 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
21imbi1i 352 . . . . 5 ((𝑥 ∈ (𝐴𝐵) → 𝑥𝐶) ↔ ((𝑥𝐴𝑥𝐵) → 𝑥𝐶))
3 iman 406 . . . . 5 (((𝑥𝐴𝑥𝐵) → 𝑥𝐶) ↔ ¬ ((𝑥𝐴𝑥𝐵) ∧ ¬ 𝑥𝐶))
42, 3bitri 278 . . . 4 ((𝑥 ∈ (𝐴𝐵) → 𝑥𝐶) ↔ ¬ ((𝑥𝐴𝑥𝐵) ∧ ¬ 𝑥𝐶))
5 eldif 3914 . . . . . 6 (𝑥 ∈ (𝐵𝐶) ↔ (𝑥𝐵 ∧ ¬ 𝑥𝐶))
65anbi2i 634 . . . . 5 ((𝑥𝐴𝑥 ∈ (𝐵𝐶)) ↔ (𝑥𝐴 ∧ (𝑥𝐵 ∧ ¬ 𝑥𝐶)))
7 elin 3920 . . . . 5 (𝑥 ∈ (𝐴 ∩ (𝐵𝐶)) ↔ (𝑥𝐴𝑥 ∈ (𝐵𝐶)))
8 anass 473 . . . . 5 (((𝑥𝐴𝑥𝐵) ∧ ¬ 𝑥𝐶) ↔ (𝑥𝐴 ∧ (𝑥𝐵 ∧ ¬ 𝑥𝐶)))
96, 7, 83bitr4ri 307 . . . 4 (((𝑥𝐴𝑥𝐵) ∧ ¬ 𝑥𝐶) ↔ 𝑥 ∈ (𝐴 ∩ (𝐵𝐶)))
104, 9xchbinx 337 . . 3 ((𝑥 ∈ (𝐴𝐵) → 𝑥𝐶) ↔ ¬ 𝑥 ∈ (𝐴 ∩ (𝐵𝐶)))
1110albii 1847 . 2 (∀𝑥(𝑥 ∈ (𝐴𝐵) → 𝑥𝐶) ↔ ∀𝑥 ¬ 𝑥 ∈ (𝐴 ∩ (𝐵𝐶)))
12 df-ss 3921 . 2 ((𝐴𝐵) ⊆ 𝐶 ↔ ∀𝑥(𝑥 ∈ (𝐴𝐵) → 𝑥𝐶))
13 eq0 4303 . 2 ((𝐴 ∩ (𝐵𝐶)) = ∅ ↔ ∀𝑥 ¬ 𝑥 ∈ (𝐴 ∩ (𝐵𝐶)))
1411, 12, 133bitr4i 306 1 ((𝐴𝐵) ⊆ 𝐶 ↔ (𝐴 ∩ (𝐵𝐶)) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400  wal 1566   = wceq 1568  wcel 2141  cdif 3901  cin 3903  wss 3904  c0 4285
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-ext 2733
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1571  df-fal 1581  df-ex 1808  df-sb 2095  df-clab 2740  df-cleq 2753  df-clel 2836  df-v 3455  df-dif 3907  df-in 3911  df-ss 3921  df-nul 4286
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator