Theorem dffin1-5 10393

Description: Compact quantifier-free version of the standard definition df-fin 8959. (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.

Step	Hyp	Ref	Expression
1		ensymb 9011	. . . 4 ⊢ (𝑥 ≈ 𝑦 ↔ 𝑦 ≈ 𝑥)
2	1	rexbii 3111	. . 3 ⊢ (∃𝑦 ∈ ω 𝑥 ≈ 𝑦 ↔ ∃𝑦 ∈ ω 𝑦 ≈ 𝑥)
3	2	abbii 2829	. 2 ⊢ {𝑥 ∣ ∃𝑦 ∈ ω 𝑥 ≈ 𝑦} = {𝑥 ∣ ∃𝑦 ∈ ω 𝑦 ≈ 𝑥}
4		df-fin 8959	. 2 ⊢ Fin = {𝑥 ∣ ∃𝑦 ∈ ω 𝑥 ≈ 𝑦}
5		dfima2 6062	. 2 ⊢ ( ≈ “ ω) = {𝑥 ∣ ∃𝑦 ∈ ω 𝑦 ≈ 𝑥}
6	3, 4, 5	3eqtr4i 2795	1 ⊢ Fin = ( ≈ “ ω)

This proof depends on syntax axioms:   = wceq 1570  {cab 2740  ∃wrex 3088   class class class wbr 5107   “ cima 5662  ωcom 7865   ≈ cen 8952  Fincfn 8955

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-pow 5334  ax-pr 5402  ax-un 7739

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-er 8699  df-en 8956  df-fin 8959

This theorem is used by: (None)