| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sdomtr | Structured version Visualization version GIF version | ||
| Description: Strict dominance is transitive. Theorem 21(iii) of [Suppes] p. 97. (Contributed by NM, 9-Jun-1998.) |
| Ref | Expression |
|---|---|
| sdomtr | ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝐶) → 𝐴 ≺ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sdomdom 8919 | . 2 ⊢ (𝐴 ≺ 𝐵 → 𝐴 ≼ 𝐵) | |
| 2 | domsdomtr 9042 | . 2 ⊢ ((𝐴 ≼ 𝐵 ∧ 𝐵 ≺ 𝐶) → 𝐴 ≺ 𝐶) | |
| 3 | 1, 2 | sylan 581 | 1 ⊢ ((𝐴 ≺ 𝐵 ∧ 𝐵 ≺ 𝐶) → 𝐴 ≺ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 class class class wbr 5097 ≼ cdom 8883 ≺ csdm 8884 |
| 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-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ral 3051 df-rex 3060 df-rab 3399 df-v 3441 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 |
| This theorem is referenced by: sdomn2lp 9046 2pwuninel 9062 2pwne 9063 r1sdom 9688 alephordi 9986 pwsdompw 10115 gruina 10731 rexpen 16155 sdomne0 43691 sdomne0d 43692 |
| Copyright terms: Public domain | W3C validator |