HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem sdomdom 3290
Description: Strict dominance implies dominance.
Assertion
Ref Expression
sdomdom |- (A ~< B -> A ~<_ B)

Proof of Theorem sdomdom
StepHypRef Expression
1 brsdom 3286 . 2 |- (A ~< B <-> (A ~<_ B /\ -. A ~~ B))
21pm3.26bd 259 1 |- (A ~< B -> A ~<_ B)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   class class class wbr 2054   ~~ cen 3271   ~<_ cdom 3272   ~< csdm 3273
This theorem is referenced by:  sdomnsym 3364  sdomdomtr 3370  sdomtr 3373  isfinite2 3437  entri3 3647  sucdom 3648  sucxpdom 3652  infxpidmlem12 4944  infdif 4948  infmap1 4950  alephexp1 4954
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-dif 1489  df-br 2063  df-sdom 3276
metamath.org