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

Theorem ineqcomi 4165
Description: Two ways of expressing that two classes have a given intersection. Inference form of ineqcom 4164. 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 4163 . 2 (𝐵𝐴) = (𝐴𝐵)
2 ineqcomi.1 . 2 (𝐴𝐵) = 𝐶
31, 2eqtri 2760 1 (𝐵𝐴) = 𝐶
Colors of variables: wff setvar class
Syntax hints:   = wceq 1542  cin 3902
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 1912  ax-6 1969  ax-7 2010  ax-9 2124  ax-ext 2709
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-rab 3402  df-in 3910
This theorem is referenced by:  cnvimainrn  7021  cnfldfunALT  21336  cnfldfunALTOLD  21349  psdmul  22121  xrlimcnp  26946  nn0diffz0  32885  vonf1owev  35324  inres2  38498  ecqmap  38700  readvrec  42732  isubgr0uhgr  48233
  Copyright terms: Public domain W3C validator