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

Theorem fin2inf 4547
Description: This (useless) theorem, which was proved without the Axiom of Infinity, demonstrates an artifact of our definition of strict dominance, which is meaningful only when its arguments exist. In particular, the antecedent cannot be satisfied unless om exists.
Assertion
Ref Expression
fin2inf |- (A ~< om -> om e. V)

Proof of Theorem fin2inf
StepHypRef Expression
1 sdomex 4473 . 2 |- (A ~< om -> (A e. V /\ om e. V))
21pm3.27d 325 1 |- (A ~< om -> om e. V)
Colors of variables: wff set class
Syntax hints:   -> wi 3   e. wcel 958  Vcvv 1811   class class class wbr 2619  omcom 3131   ~< csdm 4366
This theorem is referenced by:  unfi2 4553  unifi2 4558
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-9 965  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-br 2620  df-opab 2667  df-id 2835  df-xp 3184  df-rel 3185  df-cnv 3186  df-co 3187  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fun 3192  df-fn 3193  df-f 3194  df-f1 3195  df-fo 3196  df-f1o 3197  df-en 4368  df-dom 4369  df-sdom 4370
Copyright terms: Public domain