Theorem ecexr 8753

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 4289	. . 3 ⊢ (𝐴 ∈ (𝑅 “ {𝐵}) → ¬ (𝑅 “ {𝐵}) = ∅)
2		snprc 4678	. . . . 5 ⊢ (¬ 𝐵 ∈ V ↔ {𝐵} = ∅)
3		imaeq2 6061	. . . . 5 ⊢ ({𝐵} = ∅ → (𝑅 “ {𝐵}) = (𝑅 “ ∅))
4	2, 3	sylbi 220	. . . 4 ⊢ (¬ 𝐵 ∈ V → (𝑅 “ {𝐵}) = (𝑅 “ ∅))
5		ima0 6088	. . . 4 ⊢ (𝑅 “ ∅) = ∅
6	4, 5	eqtrdi 2814	. . 3 ⊢ (¬ 𝐵 ∈ V → (𝑅 “ {𝐵}) = ∅)
7	1, 6	nsyl2 142	. 2 ⊢ (𝐴 ∈ (𝑅 “ {𝐵}) → 𝐵 ∈ V)
8		df-ec 8750	. 2 ⊢ [𝐵]𝑅 = (𝑅 “ {𝐵})
9	7, 8	eleq2s 2882	1 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐵 ∈ V)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ∅c0 4281  {csn 4588   “ cima 5659  [cec 8746

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-ext 2735  ax-sep 5253  ax-pr 5396

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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  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-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-xp 5662  df-cnv 5664  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-ec 8750

This theorem is used by:  relelec  8796  ecdmn0  8801  erdisj  8806  eqvreldisj  39833