Theorem cotr2 15038

Description: Two ways of saying a relation is transitive. Special instance of cotr2g 15037. (Contributed by RP, 22-Mar-2020.)

Hypotheses

Ref	Expression
cotr2.a	⊢ dom 𝑅 ⊆ 𝐴
cotr2.b	⊢ (dom 𝑅 ∩ ran 𝑅) ⊆ 𝐵
cotr2.c	⊢ ran 𝑅 ⊆ 𝐶

Assertion

Ref	Expression
cotr2	⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑅   𝑥,𝐴,𝑦,𝑧   𝑦,𝐵,𝑧   𝑧,𝐶

Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥, 𝑦)

Proof of Theorem cotr2

Step	Hyp	Ref	Expression
1		cotr2.a	. 2 ⊢ dom 𝑅 ⊆ 𝐴
2		incom 4162	. . 3 ⊢ (dom 𝑅 ∩ ran 𝑅) = (ran 𝑅 ∩ dom 𝑅)
3		cotr2.b	. . 3 ⊢ (dom 𝑅 ∩ ran 𝑅) ⊆ 𝐵
4	2, 3	eqsstrri 3985	. 2 ⊢ (ran 𝑅 ∩ dom 𝑅) ⊆ 𝐵
5		cotr2.c	. 2 ⊢ ran 𝑅 ⊆ 𝐶
6	1, 4, 5	cotr2g 15037	1 ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wral 3081   ∩ cin 3905   ⊆ wss 3906   class class class wbr 5111  dom cdm 5663  ran crn 5664   ∘ ccom 5667

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674

This theorem is used by:  cotr3  15039