Theorem cnvin 6134

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

Step	Hyp	Ref	Expression
1		cnvdif 6133	. . 3 ⊢ ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) = (◡𝐴 ∖ ◡(𝐴 ∖ 𝐵))
2		cnvdif 6133	. . . 4 ⊢ ◡(𝐴 ∖ 𝐵) = (◡𝐴 ∖ ◡𝐵)
3	2	difeq2i 4060	. . 3 ⊢ (◡𝐴 ∖ ◡(𝐴 ∖ 𝐵)) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵))
4	1, 3	eqtri 2783	. 2 ⊢ ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵))
5		dfin4 4223	. . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐴 ∖ (𝐴 ∖ 𝐵))
6	5	cnveqi 5851	. 2 ⊢ ◡(𝐴 ∩ 𝐵) = ◡(𝐴 ∖ (𝐴 ∖ 𝐵))
7		dfin4 4223	. 2 ⊢ (◡𝐴 ∩ ◡𝐵) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵))
8	4, 6, 7	3eqtr4i 2793	1 ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵)

This proof depends on syntax axioms:   = wceq 1569   ∖ cdif 4045   ∩ cin 4089  ^◡ccnv 5649

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658

This theorem is used by:  rninOLD  6137  dminxp  6171  imainrect  6172  cnvcnv  6183  cnvrescnv  6187  pjdm  22013  ordtrest2  23522  ustexsym  24535  trust  24548  ordtcnvNEW  34552  ordtrest2NEW  34555  msrf  36307  elrn3  36527  pprodcnveq  36645  tposrescnv  49987