Theorem dffin1-5 10378

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

This proof depends on syntax axioms:   = wceq 1569  {cab 2740  ∃wrex 3088   class class class wbr 5108   “ cima 5663  ωcom 7860   ≈ cen 8938  Fincfn 8941

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  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 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-er 8692  df-en 8942  df-fin 8945

This theorem is used by: (None)