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

Theorem griedg0prc 16130
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 4217 . . . 4  |-  (/)  e.  _V
2 feq1 5467 . . . 4  |-  ( e  =  (/)  ->  ( e : (/) --> (/)  <->  (/) : (/) --> (/) ) )
3 f0 5530 . . . 4  |-  (/) : (/) --> (/)
41, 2, 3ceqsexv2d 2842 . . 3  |-  E. e 
e : (/) --> (/)
5 opabn1stprc 6363 . . 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 2500 . . 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 2496   _Vcvv 2801   (/)c0 3493   {copab 4150   -->wf 5324
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 2203  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-nul 4216  ax-pow 4266  ax-pr 4301  ax-un 4532
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-nel 2497  df-ral 2514  df-rex 2515  df-v 2803  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-br 4090  df-opab 4152  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-fun 5330  df-fn 5331  df-f 5332
This theorem is referenced by:  usgrprc  16132
  Copyright terms: Public domain W3C validator