Theorem relcnvtr 6226

Description: A relation is transitive iff its converse is transitive. (Contributed by FL, 19-Sep-2011.) (Proof shortened by Peter Mazsa, 17-Oct-2023.)

Assertion

Ref	Expression
relcnvtr	⊢ (Rel 𝑅 → ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ (◡𝑅 ∘ ◡𝑅) ⊆ ◡𝑅))

Proof of Theorem relcnvtr

Step	Hyp	Ref	Expression
1		3anidm 1109	. 2 ⊢ ((Rel 𝑅 ∧ Rel 𝑅 ∧ Rel 𝑅) ↔ Rel 𝑅)
2		relcnvtrg 6225	. 2 ⊢ ((Rel 𝑅 ∧ Rel 𝑅 ∧ Rel 𝑅) → ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ (◡𝑅 ∘ ◡𝑅) ⊆ ◡𝑅))
3	1, 2	sylbir 236	1 ⊢ (Rel 𝑅 → ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ (◡𝑅 ∘ ◡𝑅) ⊆ ◡𝑅))

Syntax hints:   → wi 4   ↔ wb 207   ∧ w3a 1092   ⊆ wss 3890  ^◡ccnv 5624   ∘ ccom 5629  Rel wrel 5630

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712  ax-sep 5225  ax-pr 5369

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-br 5080  df-opab 5142  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634

This theorem is referenced by: (None)