Theorem potr 2134

Description: A partial order relation is a transitive relation.

Assertion

Ref	Expression
potr	⊢ ((R Po A ∧ (B ∈ A ∧ C ∈ A ∧ D ∈ A)) → ((BRC ∧ CRD) → BRD))

Proof of Theorem potr

Step	Hyp	Ref	Expression
1		pocl 2132	. . 3 ⊢ (R Po A → ((B ∈ A ∧ C ∈ A ∧ D ∈ A) → (¬ BRB ∧ ((BRC ∧ CRD) → BRD))))
2	1	imp 277	. 2 ⊢ ((R Po A ∧ (B ∈ A ∧ C ∈ A ∧ D ∈ A)) → (¬ BRB ∧ ((BRC ∧ CRD) → BRD)))
3	2	pm3.27d 262	1 ⊢ ((R Po A ∧ (B ∈ A ∧ C ∈ A ∧ D ∈ A)) → ((BRC ∧ CRD) → BRD))

Syntax hints:  ¬ wn 1   → wi 2   ∧ wa 196   ∧ w3a 581   ∈ wcel 1092   class class class wbr 2054   Po wpo 2058

This theorem is referenced by:  po2nr 2135  po3nr 2136  sotr 2144  zornlem7 3609

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-v 1349  df-un 1490  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063  df-po 2128

metamath.org