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

Theorem dfsdom2 3362
Description: Alternate definition of strict dominance. Compare Definition 3 of [Suppes] p. 97.
Assertion
Ref Expression
dfsdom2 |- ~< = ( ~<_ \ `' ~<_ )

Proof of Theorem dfsdom2
StepHypRef Expression
1 df-sdom 3276 . 2 |- ~< = ( ~<_ \ ~~ )
2 sbthcl 3361 . . 3 |- ~~ = ( ~<_ i^i `' ~<_ )
32difeq2i 1585 . 2 |- ( ~<_ \ ~~ ) = ( ~<_ \ ( ~<_ i^i `' ~<_ ))
4 difin 1670 . 2 |- ( ~<_ \ ( ~<_ i^i `' ~<_ )) = ( ~<_ \ `' ~<_ )
51, 3, 43eqtr 1123 1 |- ~< = ( ~<_ \ `' ~<_ )
Colors of variables: wff set class
Syntax hints:   = wceq 1091   \ cdif 1484   i^i cin 1486  `'ccnv 2409   ~~ cen 3271   ~<_ cdom 3272   ~< csdm 3273
This theorem is referenced by:  brsdom2 3363
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-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-br 2063  df-opab 2098  df-id 2125  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-f1 2435  df-fo 2436  df-f1o 2437  df-er 3200  df-en 3274  df-dom 3275  df-sdom 3276
metamath.org