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

Theorem cnvin 6146
Description: Distributive law for converse over intersection. Theorem 15 of [Suppes] p. 62. (Contributed by NM, 25-Mar-1998.) (Revised by Mario Carneiro, 26-Jun-2014.)
Assertion
Ref Expression
cnvin ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵)

Proof of Theorem cnvin
StepHypRef Expression
1 cnvdif 6145 . . 3 ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) = (◡𝐴 ∖ ◡(𝐴 ∖ 𝐵))
2 cnvdif 6145 . . . 4 ◡(𝐴 ∖ 𝐵) = (◡𝐴 ∖ ◡𝐵)
32difeq2i 4063 . . 3 (◡𝐴 ∖ ◡(𝐴 ∖ 𝐵)) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵))
41, 3eqtri 2786 . 2 ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵))
5 dfin4 4226 . . 3 (𝐴 ∩ 𝐵) = (𝐴 ∖ (𝐴 ∖ 𝐵))
65cnveqi 5858 . 2 ◡(𝐴 ∩ 𝐵) = ◡(𝐴 ∖ (𝐴 ∖ 𝐵))
7 dfin4 4226 . 2 (◡𝐴 ∩ ◡𝐵) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵))
84, 6, 73eqtr4i 2796 1 ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∖ cdif 4048   ∩ cin 4092  ◡ccnv 5654
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-xp 5661  df-rel 5662  df-cnv 5663
This theorem is used by:  rninOLD  6149  dminxp  6183  imainrect  6184  cnvcnv  6195  cnvrescnv  6199  pjdm  22040  ordtrest2  23549  ustexsym  24562  trust  24575  ordtcnvNEW  34619  ordtrest2NEW  34622  msrf  36473  elrn3  36704  pprodcnveq  36822  tposrescnv  50195
  Copyright terms: Public domain W3C validator