MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fin2inf Structured version   Visualization version   GIF version

Theorem fin2inf 9370
Description: This (useless) theorem, which was proved without the Axiom of Infinity, demonstrates an artifact of our definition of binary relation, which is meaningful only when its arguments exist. In particular, the antecedent cannot be satisfied unless ω exists. (Contributed by NM, 13-Nov-2003.)
Assertion
Ref Expression
fin2inf (𝐴 ≺ ω → ω ∈ V)

Proof of Theorem fin2inf
StepHypRef Expression
1 relsdom 9010 . 2 Rel ≺
21brrelex2i 5757 1 (𝐴 ≺ ω → ω ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2108  Vcvv 3488   class class class wbr 5166  ωcom 7903  csdm 9002
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-br 5167  df-opab 5229  df-xp 5706  df-rel 5707  df-dom 9005  df-sdom 9006
This theorem is referenced by:  unfi2  9376  unifi2  9413
  Copyright terms: Public domain W3C validator