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

Theorem ineqri 4130
 Description: Inference from membership to intersection. (Contributed by NM, 21-Jun-1993.)
Hypothesis
Ref Expression
ineqri.1 ((𝑥𝐴𝑥𝐵) ↔ 𝑥𝐶)
Assertion
Ref Expression
ineqri (𝐴𝐵) = 𝐶
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem ineqri
StepHypRef Expression
1 elin 3897 . . 3 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
2 ineqri.1 . . 3 ((𝑥𝐴𝑥𝐵) ↔ 𝑥𝐶)
31, 2bitri 278 . 2 (𝑥 ∈ (𝐴𝐵) ↔ 𝑥𝐶)
43eqriv 2795 1 (𝐴𝐵) = 𝐶
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111   ∩ cin 3880 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2770 This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-v 3443  df-in 3888 This theorem is referenced by:  inidm  4145  inass  4146  dfin2  4187  indi  4200  inab  4223  in0  4299  pwin  5420  dfres3  5824  dmres  5841  inixp  35185
 Copyright terms: Public domain W3C validator