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

Theorem griedg0prc 16104
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 4216 . . . 4  |-  (/)  e.  _V
2 feq1 5465 . . . 4  |-  ( e  =  (/)  ->  ( e : (/) --> (/)  <->  (/) : (/) --> (/) ) )
3 f0 5527 . . . 4  |-  (/) : (/) --> (/)
41, 2, 3ceqsexv2d 2843 . . 3  |-  E. e 
e : (/) --> (/)
5 opabn1stprc 6358 . . 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 2501 . . 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 1397   E.wex 1540    e/ wnel 2497   _Vcvv 2802   (/)c0 3494   {copab 4149   -->wf 5322
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-nel 2498  df-ral 2515  df-rex 2516  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-fun 5328  df-fn 5329  df-f 5330
This theorem is referenced by:  usgrprc  16106
  Copyright terms: Public domain W3C validator