Theorem cnvin 6143

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 6142	. . 3 ⊢ ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) = (◡𝐴 ∖ ◡(𝐴 ∖ 𝐵))
2		cnvdif 6142	. . . 4 ⊢ ◡(𝐴 ∖ 𝐵) = (◡𝐴 ∖ ◡𝐵)
3	2	difeq2i 4078	. . 3 ⊢ (◡𝐴 ∖ ◡(𝐴 ∖ 𝐵)) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵))
4	1, 3	eqtri 2788	. 2 ⊢ ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵))
5		dfin4 4231	. . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐴 ∖ (𝐴 ∖ 𝐵))
6	5	cnveqi 5862	. 2 ⊢ ◡(𝐴 ∩ 𝐵) = ◡(𝐴 ∖ (𝐴 ∖ 𝐵))
7		dfin4 4231	. 2 ⊢ (◡𝐴 ∩ ◡𝐵) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵))
8	4, 6, 7	3eqtr4i 2798	1 ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵)

This proof depends on syntax axioms:   = wceq 1570   ∖ cdif 3903   ∩ cin 3905  ^◡ccnv 5662

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406

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 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-xp 5669  df-rel 5670  df-cnv 5671

This theorem is used by:  rninOLD  6146  dminxp  6180  imainrect  6181  cnvcnv  6192  cnvrescnv  6196  pjdm  21911  ordtrest2  23415  ustexsym  24428  trust  24441  ordtcnvNEW  34378  ordtrest2NEW  34381  msrf  36075  elrn3  36295  pprodcnveq  36414  tposrescnv  49733