![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > poltletr | Structured version Visualization version GIF version |
Description: Transitive law for general strict orders. (Contributed by Stefan O'Rear, 17-Jan-2015.) |
Ref | Expression |
---|---|
poltletr | ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ 𝐵(𝑅 ∪ I )𝐶) → 𝐴𝑅𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | poleloe 5828 | . . . . 5 ⊢ (𝐶 ∈ 𝑋 → (𝐵(𝑅 ∪ I )𝐶 ↔ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶))) | |
2 | 1 | 3ad2ant3 1115 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵(𝑅 ∪ I )𝐶 ↔ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶))) |
3 | 2 | adantl 474 | . . 3 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵(𝑅 ∪ I )𝐶 ↔ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶))) |
4 | 3 | anbi2d 619 | . 2 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ 𝐵(𝑅 ∪ I )𝐶) ↔ (𝐴𝑅𝐵 ∧ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶)))) |
5 | potr 5334 | . . . . 5 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)) | |
6 | 5 | com12 32 | . . . 4 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴𝑅𝐶)) |
7 | breq2 4929 | . . . . . 6 ⊢ (𝐵 = 𝐶 → (𝐴𝑅𝐵 ↔ 𝐴𝑅𝐶)) | |
8 | 7 | biimpac 471 | . . . . 5 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵 = 𝐶) → 𝐴𝑅𝐶) |
9 | 8 | a1d 25 | . . . 4 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵 = 𝐶) → ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴𝑅𝐶)) |
10 | 6, 9 | jaodan 940 | . . 3 ⊢ ((𝐴𝑅𝐵 ∧ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶)) → ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴𝑅𝐶)) |
11 | 10 | com12 32 | . 2 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶)) → 𝐴𝑅𝐶)) |
12 | 4, 11 | sylbid 232 | 1 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ 𝐵(𝑅 ∪ I )𝐶) → 𝐴𝑅𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ wa 387 ∨ wo 833 ∧ w3a 1068 = wceq 1507 ∈ wcel 2050 ∪ cun 3821 class class class wbr 4925 I cid 5307 Po wpo 5320 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1965 ax-8 2052 ax-9 2059 ax-10 2079 ax-11 2093 ax-12 2106 ax-13 2301 ax-ext 2744 ax-sep 5056 ax-nul 5063 ax-pr 5182 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2016 df-mo 2547 df-eu 2584 df-clab 2753 df-cleq 2765 df-clel 2840 df-nfc 2912 df-ral 3087 df-rex 3088 df-rab 3091 df-v 3411 df-dif 3826 df-un 3828 df-in 3830 df-ss 3837 df-nul 4173 df-if 4345 df-sn 4436 df-pr 4438 df-op 4442 df-br 4926 df-opab 4988 df-id 5308 df-po 5322 df-xp 5409 df-rel 5410 |
This theorem is referenced by: soltmin 5833 |
Copyright terms: Public domain | W3C validator |