![]() |
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 6154 | . . . . 5 ⊢ (𝐶 ∈ 𝑋 → (𝐵(𝑅 ∪ I )𝐶 ↔ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶))) | |
2 | 1 | 3ad2ant3 1134 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵(𝑅 ∪ I )𝐶 ↔ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶))) |
3 | 2 | adantl 481 | . . 3 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵(𝑅 ∪ I )𝐶 ↔ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶))) |
4 | 3 | anbi2d 630 | . 2 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ 𝐵(𝑅 ∪ I )𝐶) ↔ (𝐴𝑅𝐵 ∧ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶)))) |
5 | potr 5610 | . . . . 5 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)) | |
6 | 5 | com12 32 | . . . 4 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴𝑅𝐶)) |
7 | breq2 5152 | . . . . . 6 ⊢ (𝐵 = 𝐶 → (𝐴𝑅𝐵 ↔ 𝐴𝑅𝐶)) | |
8 | 7 | biimpac 478 | . . . . 5 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵 = 𝐶) → 𝐴𝑅𝐶) |
9 | 8 | a1d 25 | . . . 4 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵 = 𝐶) → ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴𝑅𝐶)) |
10 | 6, 9 | jaodan 959 | . . 3 ⊢ ((𝐴𝑅𝐵 ∧ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶)) → ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴𝑅𝐶)) |
11 | 10 | com12 32 | . 2 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ (𝐵𝑅𝐶 ∨ 𝐵 = 𝐶)) → 𝐴𝑅𝐶)) |
12 | 4, 11 | sylbid 240 | 1 ⊢ ((𝑅 Po 𝑋 ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑅𝐵 ∧ 𝐵(𝑅 ∪ I )𝐶) → 𝐴𝑅𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ∪ cun 3961 class class class wbr 5148 I cid 5582 Po wpo 5595 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-br 5149 df-opab 5211 df-id 5583 df-po 5597 df-xp 5695 df-rel 5696 |
This theorem is referenced by: soltmin 6159 |
Copyright terms: Public domain | W3C validator |