Theorem cnvin 6141

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

This proof depends on syntax axioms:   = wceq 1570   ∖ cdif 3902   ∩ cin 3904  ^◡ccnv 5660

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-xp 5667  df-rel 5668  df-cnv 5669

This theorem is used by:  rninOLD  6144  dminxp  6178  imainrect  6179  cnvcnv  6190  cnvrescnv  6194  pjdm  21866  ordtrest2  23370  ustexsym  24382  trust  24395  ordtcnvNEW  34319  ordtrest2NEW  34322  msrf  36042  elrn3  36262  pprodcnveq  36381  tposrescnv  49685