sotri2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > sotri2		Structured version Visualization version GIF version

Theorem sotri2 5989

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 5617	. . . 4 ⊢ (𝐵𝑅𝐶 → (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆))
3	2	simpld 497	. . 3 ⊢ (𝐵𝑅𝐶 → 𝐵 ∈ 𝑆)
4		soi.1	. . . . . . 7 ⊢ 𝑅 Or 𝑆
5		sotric 5501	. . . . . . 7 ⊢ ((𝑅 Or 𝑆 ∧ (𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆)) → (𝐵𝑅𝐴 ↔ ¬ (𝐵 = 𝐴 ∨ 𝐴𝑅𝐵)))
6	4, 5	mpan 688	. . . . . 6 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → (𝐵𝑅𝐴 ↔ ¬ (𝐵 = 𝐴 ∨ 𝐴𝑅𝐵)))
7	6	con2bid 357	. . . . 5 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → ((𝐵 = 𝐴 ∨ 𝐴𝑅𝐵) ↔ ¬ 𝐵𝑅𝐴))
8		breq1 5069	. . . . . . 7 ⊢ (𝐵 = 𝐴 → (𝐵𝑅𝐶 ↔ 𝐴𝑅𝐶))
9	8	biimpd 231	. . . . . 6 ⊢ (𝐵 = 𝐴 → (𝐵𝑅𝐶 → 𝐴𝑅𝐶))
10	4, 1	sotri 5987	. . . . . . 7 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)
11	10	ex 415	. . . . . 6 ⊢ (𝐴𝑅𝐵 → (𝐵𝑅𝐶 → 𝐴𝑅𝐶))
12	9, 11	jaoi 853	. . . . 5 ⊢ ((𝐵 = 𝐴 ∨ 𝐴𝑅𝐵) → (𝐵𝑅𝐶 → 𝐴𝑅𝐶))
13	7, 12	syl6bir 256	. . . 4 ⊢ ((𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → (¬ 𝐵𝑅𝐴 → (𝐵𝑅𝐶 → 𝐴𝑅𝐶)))
14	13	com3r 87	. . 3 ⊢ (𝐵𝑅𝐶 → ((𝐵 ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → (¬ 𝐵𝑅𝐴 → 𝐴𝑅𝐶)))
15	3, 14	mpand 693	. 2 ⊢ (𝐵𝑅𝐶 → (𝐴 ∈ 𝑆 → (¬ 𝐵𝑅𝐴 → 𝐴𝑅𝐶)))
16	15	3imp231 1109	1 ⊢ ((𝐴 ∈ 𝑆 ∧ ¬ 𝐵𝑅𝐴 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ⊆ wss 3936 class class class wbr 5066 Or wor 5473 × cxp 5553

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-br 5067 df-opab 5129 df-po 5474 df-so 5475 df-xp 5561

This theorem is referenced by: supsrlem 10533

W3C validator