| 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 6111 | . . 3 ⊢ ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) = (◡𝐴 ∖ ◡(𝐴 ∖ 𝐵)) | |
| 2 | cnvdif 6111 | . . . 4 ⊢ ◡(𝐴 ∖ 𝐵) = (◡𝐴 ∖ ◡𝐵) | |
| 3 | 2 | difeq2i 4077 | . . 3 ⊢ (◡𝐴 ∖ ◡(𝐴 ∖ 𝐵)) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵)) |
| 4 | 1, 3 | eqtri 2760 | . 2 ⊢ ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵)) |
| 5 | dfin4 4232 | . . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐴 ∖ (𝐴 ∖ 𝐵)) | |
| 6 | 5 | cnveqi 5833 | . 2 ⊢ ◡(𝐴 ∩ 𝐵) = ◡(𝐴 ∖ (𝐴 ∖ 𝐵)) |
| 7 | dfin4 4232 | . 2 ⊢ (◡𝐴 ∩ ◡𝐵) = (◡𝐴 ∖ (◡𝐴 ∖ ◡𝐵)) | |
| 8 | 4, 6, 7 | 3eqtr4i 2770 | 1 ⊢ ◡(𝐴 ∩ 𝐵) = (◡𝐴 ∩ ◡𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∖ cdif 3900 ∩ cin 3902 ◡ccnv 5633 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5245 ax-pr 5381 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5640 df-rel 5641 df-cnv 5642 |
| This theorem is referenced by: rnin 6114 dminxp 6148 imainrect 6149 cnvcnv 6160 cnvrescnv 6163 pjdm 21679 ordtrest2 23165 ustexsym 24177 trust 24190 ordtcnvNEW 34104 ordtrest2NEW 34107 msrf 35764 elrn3 35984 pprodcnveq 36103 tposrescnv 49267 |
| Copyright terms: Public domain | W3C validator |