ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ineqcomi Unicode version

Theorem ineqcomi 3415
Description: Two ways of expressing that two classes have a given intersection. Inference form of ineqcom 3414. Disjointness inference when  C  =  (/). (Contributed by Peter Mazsa, 26-Mar-2017.) (Proof shortened by SN, 20-Sep-2024.)
Hypothesis
Ref Expression
ineqcomi.1  |-  ( A  i^i  B )  =  C
Assertion
Ref Expression
ineqcomi  |-  ( B  i^i  A )  =  C

Proof of Theorem ineqcomi
StepHypRef Expression
1 incom 3413 . 2  |-  ( B  i^i  A )  =  ( A  i^i  B
)
2 ineqcomi.1 . 2  |-  ( A  i^i  B )  =  C
31, 2eqtri 2255 1  |-  ( B  i^i  A )  =  C
Colors of variables: wff set class
Syntax hints:    = wceq 1398    i^i cin 3212
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-v 2817  df-in 3219
This theorem is referenced by:  disjdifr  3584
  Copyright terms: Public domain W3C validator