ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ctex Unicode version

Theorem ctex 6615
Description: A class dominated by  om is a set. See also ctfoex 6971 which says that a countable class is a set. (Contributed by Thierry Arnoux, 29-Dec-2016.) (Proof shortened by Jim Kingdon, 13-Mar-2023.)
Assertion
Ref Expression
ctex  |-  ( A  ~<_  om  ->  A  e.  _V )

Proof of Theorem ctex
StepHypRef Expression
1 reldom 6607 . 2  |-  Rel  ~<_
21brrelex1i 4552 1  |-  ( A  ~<_  om  ->  A  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1465   _Vcvv 2660   class class class wbr 3899   omcom 4474    ~<_ cdom 6601
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 683  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-10 1468  ax-11 1469  ax-i12 1470  ax-bndl 1471  ax-4 1472  ax-14 1477  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099  ax-sep 4016  ax-pow 4068  ax-pr 4101
This theorem depends on definitions:  df-bi 116  df-3an 949  df-tru 1319  df-nf 1422  df-sb 1721  df-clab 2104  df-cleq 2110  df-clel 2113  df-nfc 2247  df-ral 2398  df-rex 2399  df-v 2662  df-un 3045  df-in 3047  df-ss 3054  df-pw 3482  df-sn 3503  df-pr 3504  df-op 3506  df-br 3900  df-opab 3960  df-xp 4515  df-rel 4516  df-dom 6604
This theorem is referenced by:  cnvct  6671  ssct  6680  xpct  11836
  Copyright terms: Public domain W3C validator