| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ineqcomi | Structured version Visualization version GIF version | ||
| Description: Two ways of expressing that two classes have a given intersection. Inference form of ineqcom 4190. Disjointness inference when 𝐶 = ∅. (Contributed by Peter Mazsa, 26-Mar-2017.) (Proof shortened by SN, 20-Sep-2024.) |
| Ref | Expression |
|---|---|
| ineqcomi.1 | ⊢ (𝐴 ∩ 𝐵) = 𝐶 |
| Ref | Expression |
|---|---|
| ineqcomi | ⊢ (𝐵 ∩ 𝐴) = 𝐶 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | incom 4189 | . 2 ⊢ (𝐵 ∩ 𝐴) = (𝐴 ∩ 𝐵) | |
| 2 | ineqcomi.1 | . 2 ⊢ (𝐴 ∩ 𝐵) = 𝐶 | |
| 3 | 1, 2 | eqtri 2757 | 1 ⊢ (𝐵 ∩ 𝐴) = 𝐶 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1539 ∩ cin 3930 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-9 2117 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1542 df-ex 1779 df-sb 2064 df-clab 2713 df-cleq 2726 df-rab 3420 df-in 3938 |
| This theorem is referenced by: cnvimainrn 7067 cnfldfunALT 21341 cnfldfunALTOLD 21354 psdmul 22118 inres2 38206 readvrec 42355 isubgr0uhgr 47817 |
| Copyright terms: Public domain | W3C validator |