Theorem encv 8953

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

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2146  Vcvv 3457   class class class wbr 5111   ≈ cen 8942

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 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406

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 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-xp 5669  df-rel 5670  df-en 8946

This theorem is used by:  bren  8955  en0  9017  en0r  9019  en1  9023  rexdif1en  9148  dif1en  9149  enp1i  9242  kardval  35598  ensucne0OLD  44289  axccd  45977