![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dfsdom2 | Structured version Visualization version GIF version |
Description: Alternate definition of strict dominance. Compare Definition 3 of [Suppes] p. 97. (Contributed by NM, 31-Mar-1998.) |
Ref | Expression |
---|---|
dfsdom2 | ⊢ ≺ = ( ≼ ∖ ◡ ≼ ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-sdom 8996 | . 2 ⊢ ≺ = ( ≼ ∖ ≈ ) | |
2 | sbthcl 9143 | . . 3 ⊢ ≈ = ( ≼ ∩ ◡ ≼ ) | |
3 | 2 | difeq2i 4136 | . 2 ⊢ ( ≼ ∖ ≈ ) = ( ≼ ∖ ( ≼ ∩ ◡ ≼ )) |
4 | difin 4281 | . 2 ⊢ ( ≼ ∖ ( ≼ ∩ ◡ ≼ )) = ( ≼ ∖ ◡ ≼ ) | |
5 | 1, 3, 4 | 3eqtri 2769 | 1 ⊢ ≺ = ( ≼ ∖ ◡ ≼ ) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ∖ cdif 3963 ∩ cin 3965 ◡ccnv 5692 ≈ cen 8990 ≼ cdom 8991 ≺ csdm 8992 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5305 ax-nul 5315 ax-pow 5374 ax-pr 5441 ax-un 7761 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ral 3062 df-rex 3071 df-rab 3437 df-v 3483 df-dif 3969 df-un 3971 df-in 3973 df-ss 3983 df-nul 4343 df-if 4535 df-pw 4610 df-sn 4635 df-pr 4637 df-op 4641 df-uni 4916 df-br 5152 df-opab 5214 df-id 5587 df-xp 5699 df-rel 5700 df-cnv 5701 df-co 5702 df-dm 5703 df-rn 5704 df-res 5705 df-ima 5706 df-fun 6571 df-fn 6572 df-f 6573 df-f1 6574 df-fo 6575 df-f1o 6576 df-er 8753 df-en 8994 df-dom 8995 df-sdom 8996 |
This theorem is referenced by: brsdom2 9145 |
Copyright terms: Public domain | W3C validator |