| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ineqcom | Structured version Visualization version GIF version | ||
| Description: Two ways of saying that two classes are disjoint (when 𝐶 = ∅: ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐵 ∩ 𝐴) = ∅)). (Contributed by Peter Mazsa, 22-Mar-2017.) |
| Ref | Expression |
|---|---|
| ineqcom | ⊢ ((𝐴 ∩ 𝐵) = 𝐶 ↔ (𝐵 ∩ 𝐴) = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | incom 3805 | . 2 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴) | |
| 2 | 1 | eqeq1i 2627 | 1 ⊢ ((𝐴 ∩ 𝐵) = 𝐶 ↔ (𝐵 ∩ 𝐴) = 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 196 = wceq 1483 ∩ cin 3573 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
| This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-v 3202 df-in 3581 |
| This theorem is referenced by: ineqcomi 34006 |
| Copyright terms: Public domain | W3C validator |