Theorem ecexr 8705

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 4681	. . . . 5 ⊢ (¬ 𝐵 ∈ V ↔ {𝐵} = ∅)
3		imaeq2 6056	. . . . 5 ⊢ ({𝐵} = ∅ → (𝑅 “ {𝐵}) = (𝑅 “ ∅))
4	2, 3	sylbi 220	. . . 4 ⊢ (¬ 𝐵 ∈ V → (𝑅 “ {𝐵}) = (𝑅 “ ∅))
5		ima0 6077	. . . 4 ⊢ (𝑅 “ ∅) = ∅
6	4, 5	eqtrdi 2813	. . 3 ⊢ (¬ 𝐵 ∈ V → (𝑅 “ {𝐵}) = ∅)
7	1, 6	nsyl2 142	. 2 ⊢ (𝐴 ∈ (𝑅 “ {𝐵}) → 𝐵 ∈ V)
8		df-ec 8702	. 2 ⊢ [𝐵]𝑅 = (𝑅 “ {𝐵})
9	7, 8	eleq2s 2880	1 ⊢ (𝐴 ∈ [𝐵]𝑅 → 𝐵 ∈ V)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3453  ∅c0 4282  {csn 4587   “ cima 5662  [cec 8698

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402

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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665  df-cnv 5667  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ec 8702

This theorem is used by:  relelec  8748  ecdmn0  8753  erdisj  8758  eqvreldisj  39454