Theorem encv 9019

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 9016	. 2 ⊢ Rel ≈
2	1	brrelex12i 5713	1 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  Vcvv 3454   class class class wbr 5108   ≈ cen 9008

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 5255  ax-pr 5398

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-ral 3081  df-rex 3091  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 4841  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-en 9012

This theorem is used by:  bren  9021  en0  9083  en0r  9085  en1  9089  rexdif1en  9214  dif1en  9215  enp1i  9308  kardval  35961  ensucne0OLD  44792  axccd  46514