Theorem sotri2 6085

Description: A transitivity relation. (Read 𝐴 ≤ 𝐵 and 𝐵 < 𝐶 implies 𝐴 < 𝐶.) (Contributed by Mario Carneiro, 10-May-2013.)

Hypotheses

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

Assertion

Ref	Expression
sotri2	⊢ ((𝐴 ∈ 𝑆 ∧ ¬ 𝐵𝑅𝐴 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)

Proof of Theorem sotri2

Step	Hyp	Ref	Expression
1		soi.2	. . . . 5 ⊢ 𝑅 ⊆ (𝑆 × 𝑆)
2	1	brel 5688	. . . 4 ⊢ (𝐵𝑅𝐶 → (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
3	2	simpld 494	. . 3 ⊢ (𝐵𝑅𝐶 → 𝐵 ∈ 𝑆)
4		soi.1	. . . . . . 7 ⊢ 𝑅 Or 𝑆
5		sotric 5561	. . . . . . 7 ⊢ ((𝑅 Or 𝑆 ∧ (𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆)) → (𝐵𝑅𝐴 ↔ ¬ (𝐵 = 𝐴 ∨ 𝐴𝑅𝐵)))
6	4, 5	mpan 691	. . . . . 6 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → (𝐵𝑅𝐴 ↔ ¬ (𝐵 = 𝐴 ∨ 𝐴𝑅𝐵)))
7	6	con2bid 354	. . . . 5 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → ((𝐵 = 𝐴 ∨ 𝐴𝑅𝐵) ↔ ¬ 𝐵𝑅𝐴))
8		breq1 5100	. . . . . . 7 ⊢ (𝐵 = 𝐴 → (𝐵𝑅𝐶 ↔ 𝐴𝑅𝐶))
9	8	biimpd 229	. . . . . 6 ⊢ (𝐵 = 𝐴 → (𝐵𝑅𝐶 → 𝐴𝑅𝐶))
10	4, 1	sotri 6083	. . . . . . 7 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)
11	10	ex 412	. . . . . 6 ⊢ (𝐴𝑅𝐵 → (𝐵𝑅𝐶 → 𝐴𝑅𝐶))
12	9, 11	jaoi 858	. . . . 5 ⊢ ((𝐵 = 𝐴 ∨ 𝐴𝑅𝐵) → (𝐵𝑅𝐶 → 𝐴𝑅𝐶))
13	7, 12	biimtrrdi 254	. . . 4 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → (¬ 𝐵𝑅𝐴 → (𝐵𝑅𝐶 → 𝐴𝑅𝐶)))
14	13	com3r 87	. . 3 ⊢ (𝐵𝑅𝐶 → ((𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → (¬ 𝐵𝑅𝐴 → 𝐴𝑅𝐶)))
15	3, 14	mpand 696	. 2 ⊢ (𝐵𝑅𝐶 → (𝐴 ∈ 𝑆 → (¬ 𝐵𝑅𝐴 → 𝐴𝑅𝐶)))
16	15	3imp231 1113	1 ⊢ ((𝐴 ∈ 𝑆 ∧ ¬ 𝐵𝑅𝐴 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ⊆ wss 3900   class class class wbr 5097   Or wor 5530   × cxp 5621

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pr 5376

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2714  df-cleq 2727  df-clel 2810  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-dif 3903  df-un 3905  df-ss 3917  df-nul 4285  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-br 5098  df-opab 5160  df-po 5531  df-so 5532  df-xp 5629

This theorem is referenced by:  supsrlem  11024