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

Theorem intun 4641
 Description: The class intersection of the union of two classes. Theorem 78 of [Suppes] p. 42. (Contributed by NM, 22-Sep-2002.)
Assertion
Ref Expression
intun (𝐴𝐵) = ( 𝐴 𝐵)

Proof of Theorem intun
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 19.26 1948 . . . 4 (∀𝑦((𝑦𝐴𝑥𝑦) ∧ (𝑦𝐵𝑥𝑦)) ↔ (∀𝑦(𝑦𝐴𝑥𝑦) ∧ ∀𝑦(𝑦𝐵𝑥𝑦)))
2 elun 3902 . . . . . . 7 (𝑦 ∈ (𝐴𝐵) ↔ (𝑦𝐴𝑦𝐵))
32imbi1i 338 . . . . . 6 ((𝑦 ∈ (𝐴𝐵) → 𝑥𝑦) ↔ ((𝑦𝐴𝑦𝐵) → 𝑥𝑦))
4 jaob 935 . . . . . 6 (((𝑦𝐴𝑦𝐵) → 𝑥𝑦) ↔ ((𝑦𝐴𝑥𝑦) ∧ (𝑦𝐵𝑥𝑦)))
53, 4bitri 264 . . . . 5 ((𝑦 ∈ (𝐴𝐵) → 𝑥𝑦) ↔ ((𝑦𝐴𝑥𝑦) ∧ (𝑦𝐵𝑥𝑦)))
65albii 1894 . . . 4 (∀𝑦(𝑦 ∈ (𝐴𝐵) → 𝑥𝑦) ↔ ∀𝑦((𝑦𝐴𝑥𝑦) ∧ (𝑦𝐵𝑥𝑦)))
7 vex 3352 . . . . . 6 𝑥 ∈ V
87elint 4615 . . . . 5 (𝑥 𝐴 ↔ ∀𝑦(𝑦𝐴𝑥𝑦))
97elint 4615 . . . . 5 (𝑥 𝐵 ↔ ∀𝑦(𝑦𝐵𝑥𝑦))
108, 9anbi12i 604 . . . 4 ((𝑥 𝐴𝑥 𝐵) ↔ (∀𝑦(𝑦𝐴𝑥𝑦) ∧ ∀𝑦(𝑦𝐵𝑥𝑦)))
111, 6, 103bitr4i 292 . . 3 (∀𝑦(𝑦 ∈ (𝐴𝐵) → 𝑥𝑦) ↔ (𝑥 𝐴𝑥 𝐵))
127elint 4615 . . 3 (𝑥 (𝐴𝐵) ↔ ∀𝑦(𝑦 ∈ (𝐴𝐵) → 𝑥𝑦))
13 elin 3945 . . 3 (𝑥 ∈ ( 𝐴 𝐵) ↔ (𝑥 𝐴𝑥 𝐵))
1411, 12, 133bitr4i 292 . 2 (𝑥 (𝐴𝐵) ↔ 𝑥 ∈ ( 𝐴 𝐵))
1514eqriv 2767 1 (𝐴𝐵) = ( 𝐴 𝐵)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 382   ∨ wo 826  ∀wal 1628   = wceq 1630   ∈ wcel 2144   ∪ cun 3719   ∩ cin 3720  ∩ cint 4609 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-v 3351  df-un 3726  df-in 3728  df-int 4610 This theorem is referenced by:  intunsn  4648  riinint  5520  fiin  8483  elfiun  8491  elrfi  37776
 Copyright terms: Public domain W3C validator