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

Theorem ineqcomi 4158
Description: Two ways of expressing that two classes have a given intersection. Inference form of ineqcom 4157. Disjointness inference when 𝐶 = ∅. (Contributed by Peter Mazsa, 26-Mar-2017.) (Proof shortened by SN, 20-Sep-2024.)
Hypothesis
Ref Expression
ineqcomi.1 (𝐴𝐵) = 𝐶
Assertion
Ref Expression
ineqcomi (𝐵𝐴) = 𝐶

Proof of Theorem ineqcomi
StepHypRef Expression
1 incom 4156 . 2 (𝐵𝐴) = (𝐴𝐵)
2 ineqcomi.1 . 2 (𝐴𝐵) = 𝐶
31, 2eqtri 2754 1 (𝐵𝐴) = 𝐶
Colors of variables: wff setvar class
Syntax hints:   = wceq 1541  cin 3896
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-9 2121  ax-ext 2703
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-rab 3396  df-in 3904
This theorem is referenced by:  cnvimainrn  7000  cnfldfunALT  21306  cnfldfunALTOLD  21319  psdmul  22081  vonf1owev  35152  inres2  38292  readvrec  42465  isubgr0uhgr  47983
  Copyright terms: Public domain W3C validator