Metamath Proof Explorer


Theorem cocnv1ssid

Description: Characterizing when the composition of a converse with a class is included in the identity relation. The instance where the two classes are equal gives a characterization of injectivity (see df-f1 ). (Contributed by BJ, 22-Oct-2026)

Ref Expression
Assertion cocnv1ssid ( ( ◡ 𝐵 ∘ 𝐴 ) ⊆ I ↔ ∀ 𝑥 ∀ 𝑦 ∀ 𝑧 ( ( 𝑥 𝐴 𝑦 ∧ 𝑧 𝐵 𝑦 ) → 𝑥 = 𝑧 ) )

Proof

Step Hyp Ref Expression
1 cocnv1ss ⊢ ( ( ◡ 𝐵 ∘ 𝐴 ) ⊆ I ↔ ∀ 𝑥 ∀ 𝑦 ∀ 𝑧 ( ( 𝑥 𝐴 𝑦 ∧ 𝑧 𝐵 𝑦 ) → 𝑥 I 𝑧 ) )
2 vex ⊢ 𝑧 ∈ V
3 2 ideq ⊢ ( 𝑥 I 𝑧 ↔ 𝑥 = 𝑧 )
4 3 imbi2i ⊢ ( ( ( 𝑥 𝐴 𝑦 ∧ 𝑧 𝐵 𝑦 ) → 𝑥 I 𝑧 ) ↔ ( ( 𝑥 𝐴 𝑦 ∧ 𝑧 𝐵 𝑦 ) → 𝑥 = 𝑧 ) )
5 4 3albii ⊢ ( ∀ 𝑥 ∀ 𝑦 ∀ 𝑧 ( ( 𝑥 𝐴 𝑦 ∧ 𝑧 𝐵 𝑦 ) → 𝑥 I 𝑧 ) ↔ ∀ 𝑥 ∀ 𝑦 ∀ 𝑧 ( ( 𝑥 𝐴 𝑦 ∧ 𝑧 𝐵 𝑦 ) → 𝑥 = 𝑧 ) )
6 1 5 bitri ⊢ ( ( ◡ 𝐵 ∘ 𝐴 ) ⊆ I ↔ ∀ 𝑥 ∀ 𝑦 ∀ 𝑧 ( ( 𝑥 𝐴 𝑦 ∧ 𝑧 𝐵 𝑦 ) → 𝑥 = 𝑧 ) )