Theorem ecexr 8725

Description: A nonempty equivalence class implies the representative is a set. (Contributed by Mario Carneiro, 9-Jul-2014.)

Assertion

Ref	Expression
ecexr	⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐵 ∈ V)

Proof of Theorem ecexr

Step	Hyp	Ref	Expression
1		n0i 4285	. . 3 ⊢ (𝐴 ∈ (𝑅 “ {𝐵}) → ¬ (𝑅 “ {𝐵}) = ∅)
2		snprc 4674	. . . . 5 ⊢ (¬ 𝐵 ∈ V ↔ {𝐵} = ∅)
3		imaeq2 6047	. . . . 5 ⊢ ({𝐵} = ∅ → (𝑅 “ {𝐵}) = (𝑅 “ ∅))
4	2, 3	sylbi 220	. . . 4 ⊢ (¬ 𝐵 ∈ V → (𝑅 “ {𝐵}) = (𝑅 “ ∅))
5		ima0 6074	. . . 4 ⊢ (𝑅 “ ∅) = ∅
6	4, 5	eqtrdi 2811	. . 3 ⊢ (¬ 𝐵 ∈ V → (𝑅 “ {𝐵}) = ∅)
7	1, 6	nsyl2 142	. 2 ⊢ (𝐴 ∈ (𝑅 “ {𝐵}) → 𝐵 ∈ V)
8		df-ec 8722	. 2 ⊢ [𝐵]𝑅 = (𝑅 “ {𝐵})
9	7, 8	eleq2s 2878	1 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐵 ∈ V)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ∅c0 4278  {csn 4584   “ cima 5653  [cec 8718

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-ext 2732  ax-sep 5248  ax-pr 5390

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-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  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-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-cnv 5658  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ec 8722

This theorem is used by:  relelec  8768  ecdmn0  8773  erdisj  8778  eqvreldisj  39723