Metamath Proof Explorer


Theorem coineq0

Description: A composition ( A o. B ) is disjoint from a class C if and only if B is disjoint from (`' A o. C ) ` . This is a form of the Schroeder rule that does not use complements. See also coeq0 . (Contributed by BJ, 8-Nov-2026)

Ref Expression
Assertion coineq0 ⊢ A ∘ B ∩ C = ∅ ↔ B ∩ A -1 ∘ C = ∅

Proof

Step Hyp Ref Expression
1 incom ⊢ B ∩ A -1 ∘ C = A -1 ∘ C ∩ B
2 cocnvcnv1 ⊢ A -1 -1 ∘ B = A ∘ B
3 2 ineq2i ⊢ C ∩ A -1 -1 ∘ B = C ∩ A ∘ B
4 incom ⊢ C ∩ A ∘ B = A ∘ B ∩ C
5 3 4 eqtri ⊢ C ∩ A -1 -1 ∘ B = A ∘ B ∩ C
6 id ⊢ A ∘ B ∩ C = ∅ → A ∘ B ∩ C = ∅
7 5 6 eqtrid ⊢ A ∘ B ∩ C = ∅ → C ∩ A -1 -1 ∘ B = ∅
8 coeq2 ⊢ C ∩ A -1 -1 ∘ B = ∅ → A -1 ∩ B ∘ C -1 ∘ C ∩ A -1 -1 ∘ B = A -1 ∩ B ∘ C -1 ∘ ∅
9 co02 ⊢ A -1 ∩ B ∘ C -1 ∘ ∅ = ∅
10 8 9 eqtrdi ⊢ C ∩ A -1 -1 ∘ B = ∅ → A -1 ∩ B ∘ C -1 ∘ C ∩ A -1 -1 ∘ B = ∅
11 comodular ⊢ A -1 ∘ C ∩ B ⊆ A -1 ∩ B ∘ C -1 ∘ C ∩ A -1 -1 ∘ B
12 sseq0 ⊢ A -1 ∘ C ∩ B ⊆ A -1 ∩ B ∘ C -1 ∘ C ∩ A -1 -1 ∘ B ∧ A -1 ∩ B ∘ C -1 ∘ C ∩ A -1 -1 ∘ B = ∅ → A -1 ∘ C ∩ B = ∅
13 11 12 mpan ⊢ A -1 ∩ B ∘ C -1 ∘ C ∩ A -1 -1 ∘ B = ∅ → A -1 ∘ C ∩ B = ∅
14 10 13 syl ⊢ C ∩ A -1 -1 ∘ B = ∅ → A -1 ∘ C ∩ B = ∅
15 7 14 syl ⊢ A ∘ B ∩ C = ∅ → A -1 ∘ C ∩ B = ∅
16 1 15 eqtrid ⊢ A ∘ B ∩ C = ∅ → B ∩ A -1 ∘ C = ∅
17 coeq2 ⊢ B ∩ A -1 ∘ C = ∅ → A ∩ C ∘ B -1 ∘ B ∩ A -1 ∘ C = A ∩ C ∘ B -1 ∘ ∅
18 co02 ⊢ A ∩ C ∘ B -1 ∘ ∅ = ∅
19 17 18 eqtrdi ⊢ B ∩ A -1 ∘ C = ∅ → A ∩ C ∘ B -1 ∘ B ∩ A -1 ∘ C = ∅
20 comodular ⊢ A ∘ B ∩ C ⊆ A ∩ C ∘ B -1 ∘ B ∩ A -1 ∘ C
21 sseq0 ⊢ A ∘ B ∩ C ⊆ A ∩ C ∘ B -1 ∘ B ∩ A -1 ∘ C ∧ A ∩ C ∘ B -1 ∘ B ∩ A -1 ∘ C = ∅ → A ∘ B ∩ C = ∅
22 20 21 mpan ⊢ A ∩ C ∘ B -1 ∘ B ∩ A -1 ∘ C = ∅ → A ∘ B ∩ C = ∅
23 19 22 syl ⊢ B ∩ A -1 ∘ C = ∅ → A ∘ B ∩ C = ∅
24 16 23 impbii ⊢ A ∘ B ∩ C = ∅ ↔ B ∩ A -1 ∘ C = ∅