Theorem encv 8699

Description: If two classes are equinumerous, both classes are sets. (Contributed by AV, 21-Mar-2019.)

Assertion

Ref	Expression
encv	⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))

Proof of Theorem encv

Step	Hyp	Ref	Expression
1		relen 8696	. 2 ⊢ Rel ≈
2	1	brrelex12i 5633	1 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))

Syntax hints:   → wi 4   ∧ wa 395   ∈ wcel 2108  Vcvv 3422   class class class wbr 5070   ≈ cen 8688

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-xp 5586  df-rel 5587  df-en 8692

This theorem is referenced by:  bren  8701  brenOLD  8702  en0  8758  en1  8765  ensucne0OLD  41035  axccd  42657