| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnvin | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| cnvin | ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvdif 6141 | . . 3 ⊢ ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) = (◡𝐴 ∖ ◡(𝐴 ∖ 𝐵)) | |
| 2 | cnvdif 6141 | . . . 4 ⊢ ◡(𝐴 ∖ 𝐵) = (◡𝐴 ∖ ◡𝐵) | |
| 3 | 2 | difeq2i 4086 | . . 3 ⊢ (◡𝐴 ∖ ◡(𝐴 ∖ 𝐵)) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵)) |
| 4 | 1, 3 | eqtri 2792 | . 2 ⊢ ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵)) |
| 5 | dfin4 4239 | . . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐴 ∖ (𝐴 ∖ 𝐵)) | |
| 6 | 5 | cnveqi 5861 | . 2 ⊢ ◡(𝐴 ∩ 𝐵) = ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) |
| 7 | dfin4 4239 | . 2 ⊢ (◡𝐴 ∩ ◡𝐵) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵)) | |
| 8 | 4, 6, 7 | 3eqtr4i 2802 | 1 ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1567 ∖ cdif 3910 ∩ cin 3912 ◡ccnv 5661 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5261 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5114 df-opab 5178 df-xp 5668 df-rel 5669 df-cnv 5670 |
| This theorem is referenced by: rninOLD 6145 dminxp 6179 imainrect 6180 cnvcnv 6191 cnvrescnv 6195 pjdm 21826 ordtrest2 23330 ustexsym 24342 trust 24355 ordtcnvNEW 34255 ordtrest2NEW 34258 msrf 35967 elrn3 36187 pprodcnveq 36306 tposrescnv 49576 |
| Copyright terms: Public domain | W3C validator |