![]() |
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 4202. 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 4201 | . 2 ⊢ (𝐵 ∩ 𝐴) = (𝐴 ∩ 𝐵) | |
2 | ineqcomi.1 | . 2 ⊢ (𝐴 ∩ 𝐵) = 𝐶 | |
3 | 1, 2 | eqtri 2759 | 1 ⊢ (𝐵 ∩ 𝐴) = 𝐶 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1540 ∩ cin 3947 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-9 2115 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1543 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2723 df-rab 3432 df-in 3955 |
This theorem is referenced by: cnvimainrn 7068 cnfldfunALT 21158 gg-cnfldfunALT 35485 inres2 37416 |
Copyright terms: Public domain | W3C validator |