Theorem dffin1-5 10466

Description: Compact quantifier-free version of the standard definition df-fin 8977. (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 9029	. . . 4 ⊢ (𝑥 ≈ 𝑦 ↔ 𝑦 ≈ 𝑥)
2	1	rexbii 3109	. . 3 ⊢ (∃𝑦 ∈ ω 𝑥 ≈ 𝑦 ↔ ∃𝑦 ∈ ω 𝑦 ≈ 𝑥)
3	2	abbii 2827	. 2 ⊢ {𝑥 ∣ ∃𝑦 ∈ ω 𝑥 ≈ 𝑦} = {𝑥 ∣ ∃𝑦 ∈ ω 𝑦 ≈ 𝑥}
4		df-fin 8977	. 2 ⊢ Fin = {𝑥 ∣ ∃𝑦 ∈ ω 𝑥 ≈ 𝑦}
5		dfima2 6057	. 2 ⊢ ( ≈ “ ω) = {𝑥 ∣ ∃𝑦 ∈ ω 𝑦 ≈ 𝑥}
6	3, 4, 5	3eqtr4i 2793	1 ⊢ Fin = ( ≈ “ ω)

This proof depends on syntax axioms:   = wceq 1569  {cab 2738  ∃wrex 3086   class class class wbr 5102   “ cima 5653  ωcom 7877   ≈ cen 8970  Fincfn 8973

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-er 8717  df-en 8974  df-fin 8977

This theorem is used by: (None)