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

Theorem isfi 4388
Description: Express "A is finite." Definition 10.29 of [TakeutiZaring] p. 91 (whose "Fin" is a predicate instead of a class).
Assertion
Ref Expression
isfi |- (A e. Fin <-> E.x e. om A ~~ x)
Distinct variable group:   x,A

Proof of Theorem isfi
StepHypRef Expression
1 df-fin 4377 . . 3 |- Fin = {y | E.x e. om y ~~ x}
21eleq2i 1541 . 2 |- (A e. Fin <-> A e. {y | E.x e. om y ~~ x})
3 relen 4378 . . . . . 6 |- Rel ~~
43brrelexi 3214 . . . . 5 |- (A ~~ x -> A e. V)
54a1i 8 . . . 4 |- (x e. om -> (A ~~ x -> A e. V))
65r19.23aiv 1746 . . 3 |- (E.x e. om A ~~ x -> A e. V)
7 breq1 2627 . . . 4 |- (y = A -> (y ~~ x <-> A ~~ x))
87rexbidv 1667 . . 3 |- (y = A -> (E.x e. om y ~~ x <-> E.x e. om A ~~ x))
96, 8elab3 1906 . 2 |- (A e. {y | E.x e. om y ~~ x} <-> E.x e. om A ~~ x)
102, 9bitr 173 1 |- (A e. Fin <-> E.x e. om A ~~ x)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   = wceq 958   e. wcel 960  {cab 1466  E.wrex 1649  Vcvv 1814   class class class wbr 2624  omcom 3137   ~~ cen 4370  Fincfn 4373
This theorem is referenced by:  snfi 4438  php3 4521  finsucdom 4532  ominf 4536  omsdomnn 4538  isfinite1 4539  enfi 4543  ssnnfi 4545  ssfi 4547  unfi 4563  fiint 4572  fodomfi 4575  pwfi 4579
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-br 2625  df-opab 2672  df-xp 3190  df-rel 3191  df-en 4374  df-fin 4377
Copyright terms: Public domain