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

Theorem dffin1-5 10300
Description: Compact quantifier-free version of the standard definition df-fin 8889. (Contributed by Stefan O'Rear, 6-Jan-2015.)
Assertion
Ref Expression
dffin1-5 Fin = ( ≈ “ ω)

Proof of Theorem dffin1-5
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ensymb 8941 . . . 4 (𝑥𝑦𝑦𝑥)
21rexbii 3083 . . 3 (∃𝑦 ∈ ω 𝑥𝑦 ↔ ∃𝑦 ∈ ω 𝑦𝑥)
32abbii 2803 . 2 {𝑥 ∣ ∃𝑦 ∈ ω 𝑥𝑦} = {𝑥 ∣ ∃𝑦 ∈ ω 𝑦𝑥}
4 df-fin 8889 . 2 Fin = {𝑥 ∣ ∃𝑦 ∈ ω 𝑥𝑦}
5 dfima2 6021 . 2 ( ≈ “ ω) = {𝑥 ∣ ∃𝑦 ∈ ω 𝑦𝑥}
63, 4, 53eqtr4i 2769 1 Fin = ( ≈ “ ω)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1541  {cab 2714  wrex 3060   class class class wbr 5098  cima 5627  ωcom 7808  cen 8882  Fincfn 8885
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-er 8635  df-en 8886  df-fin 8889
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator