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

Theorem griedg0prc 16474
Description: The class of empty graphs (represented as ordered pairs) is a proper class. (Contributed by AV, 27-Dec-2020.)
Hypothesis
Ref Expression
griedg0prc.u  |-  U  =  { <. v ,  e
>.  |  e : (/) --> (/)
}
Assertion
Ref Expression
griedg0prc  |-  U  e/  _V
Distinct variable group:    v, e
Allowed substitution hints:    U( v, e)

Proof of Theorem griedg0prc
StepHypRef Expression
1 0ex 4258 . . . 4  |-  (/)  e.  _V
2 feq1 5514 . . . 4  |-  ( e  =  (/)  ->  ( e : (/) --> (/)  <->  (/) : (/) --> (/) ) )
3 f0 5581 . . . 4  |-  (/) : (/) --> (/)
41, 2, 3ceqsexv2d 2862 . . 3  |-  E. e 
e : (/) --> (/)
5 opabn1stprc 6423 . . 3  |-  ( E. e  e : (/) --> (/)  ->  { <. v ,  e
>.  |  e : (/) --> (/)
}  e/  _V )
64, 5ax-mp 5 . 2  |-  { <. v ,  e >.  |  e : (/) --> (/) }  e/  _V
7 griedg0prc.u . . 3  |-  U  =  { <. v ,  e
>.  |  e : (/) --> (/)
}
8 neleq1 2519 . . 3  |-  ( U  =  { <. v ,  e >.  |  e : (/) --> (/) }  ->  ( U  e/  _V  <->  { <. v ,  e >.  |  e : (/) --> (/) }  e/  _V ) )
97, 8ax-mp 5 . 2  |-  ( U  e/  _V  <->  { <. v ,  e >.  |  e : (/) --> (/) }  e/  _V )
106, 9mpbir 146 1  |-  U  e/  _V
Colors of variables: wff set class
Syntax hints:    <-> wb 105    = wceq 1402   E.wex 1545    e/ wnel 2515   _Vcvv 2821   (/)c0 3520   {copab 4189   -->wf 5371
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-13 2211  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-nel 2516  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-fun 5377  df-fn 5378  df-f 5379
This theorem is referenced by:  usgrprc  16476
  Copyright terms: Public domain W3C validator