Theorem dffin1-5 10490

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

This proof depends on syntax axioms:   = wceq 1570  {cab 2741  ∃wrex 3090   class class class wbr 5106   “ cima 5658  ωcom 7898   ≈ cen 8995  Fincfn 8998

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-pow 5331  ax-pr 5395  ax-un 7772

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 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-er 8742  df-en 8999  df-fin 9002

This theorem is used by: (None)