Theorem sotri 6128

Description: A strict order relation is a transitive relation. (Contributed by NM, 10-Feb-1996.) (Revised by Mario Carneiro, 10-May-2013.)

Hypotheses

Ref	Expression
soi.1	⊢ 𝑅 Or 𝑆
soi.2	⊢ 𝑅 ⊆ (𝑆 × 𝑆)

Assertion

Ref	Expression
sotri	⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)

Proof of Theorem sotri

Step	Hyp	Ref	Expression
1		soi.2	. . . . 5 ⊢ 𝑅 ⊆ (𝑆 × 𝑆)
2	1	brel 5741	. . . 4 ⊢ (𝐴𝑅𝐵 → (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆))
3	2	simpld 495	. . 3 ⊢ (𝐴𝑅𝐵 → 𝐴 ∈ 𝑆)
4	1	brel 5741	. . 3 ⊢ (𝐵𝑅𝐶 → (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
5	3, 4	anim12i 613	. 2 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → (𝐴 ∈ 𝑆 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)))
6		soi.1	. . . 4 ⊢ 𝑅 Or 𝑆
7		sotr 5612	. . . 4 ⊢ ((𝑅 Or 𝑆 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶))
8	6, 7	mpan 688	. . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶))
9	8	3expb 1120	. 2 ⊢ ((𝐴 ∈ 𝑆 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶))
10	5, 9	mpcom 38	1 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1087   ∈ wcel 2106   ⊆ wss 3948   class class class wbr 5148   Or wor 5587   × cxp 5674

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-po 5588  df-so 5589  df-xp 5682

This theorem is referenced by:  son2lpi  6129  sotri2  6130  sotri3  6131  ltsonq  10963  ltbtwnnq  10972  nqpr  11008  prlem934  11027  ltexprlem4  11033  reclem2pr  11042  reclem4pr  11044  ltsosr  11088  addgt0sr  11098  supsrlem  11105  axpre-lttrn  11160