Metamath Proof Explorer


Theorem cocan1g

Description: Cancellation law for composition. A version of cocan1 with weaker hypotheses. (Contributed by Eric Schmidt, 29-Sep-2026)

Ref Expression
Hypotheses cocan1g.1 ⊢ φ → Fun ⁡ F -1
cocan1g.2 ⊢ φ → Rel ⁡ H
cocan1g.3 ⊢ φ → ran ⁡ H ⊆ dom ⁡ F
cocan1g.4 ⊢ φ → Rel ⁡ K
cocan1g.5 ⊢ φ → ran ⁡ K ⊆ dom ⁡ F
Assertion cocan1g ⊢ φ → F ∘ H = F ∘ K ↔ H = K

Proof

Step Hyp Ref Expression
1 cocan1g.1 ⊢ φ → Fun ⁡ F -1
2 cocan1g.2 ⊢ φ → Rel ⁡ H
3 cocan1g.3 ⊢ φ → ran ⁡ H ⊆ dom ⁡ F
4 cocan1g.4 ⊢ φ → Rel ⁡ K
5 cocan1g.5 ⊢ φ → ran ⁡ K ⊆ dom ⁡ F
6 1 2 3 cocanss1 ⊢ φ → F ∘ H ⊆ F ∘ K ↔ H ⊆ K
7 1 4 5 cocanss1 ⊢ φ → F ∘ K ⊆ F ∘ H ↔ K ⊆ H
8 6 7 anbi12d ⊢ φ → F ∘ H ⊆ F ∘ K ∧ F ∘ K ⊆ F ∘ H ↔ H ⊆ K ∧ K ⊆ H
9 eqss ⊢ F ∘ H = F ∘ K ↔ F ∘ H ⊆ F ∘ K ∧ F ∘ K ⊆ F ∘ H
10 eqss ⊢ H = K ↔ H ⊆ K ∧ K ⊆ H
11 8 9 10 3bitr4g ⊢ φ → F ∘ H = F ∘ K ↔ H = K