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

Theorem snexxph 6911
Description: A case where the antecedent of snexg 4162 is not needed. The class  { x  | 
ph } is from dcextest 4557. (Contributed by Mario Carneiro and Jim Kingdon, 4-Jul-2022.)
Assertion
Ref Expression
snexxph  |-  { {
x  |  ph } }  e.  _V
Distinct variable group:    ph, x

Proof of Theorem snexxph
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 1on 6387 . . 3  |-  1o  e.  On
21elexi 2737 . 2  |-  1o  e.  _V
3 elsni 3593 . . . . 5  |-  ( y  e.  { { x  |  ph } }  ->  y  =  { x  | 
ph } )
4 vprc 4113 . . . . . . . 8  |-  -.  _V  e.  _V
5 df-v 2727 . . . . . . . . . 10  |-  _V  =  { x  |  x  =  x }
6 equid 1689 . . . . . . . . . . . 12  |-  x  =  x
7 pm5.1im 172 . . . . . . . . . . . 12  |-  ( x  =  x  ->  ( ph  ->  ( x  =  x  <->  ph ) ) )
86, 7ax-mp 5 . . . . . . . . . . 11  |-  ( ph  ->  ( x  =  x  <->  ph ) )
98abbidv 2283 . . . . . . . . . 10  |-  ( ph  ->  { x  |  x  =  x }  =  { x  |  ph }
)
105, 9eqtr2id 2211 . . . . . . . . 9  |-  ( ph  ->  { x  |  ph }  =  _V )
1110eleq1d 2234 . . . . . . . 8  |-  ( ph  ->  ( { x  | 
ph }  e.  _V  <->  _V  e.  _V ) )
124, 11mtbiri 665 . . . . . . 7  |-  ( ph  ->  -.  { x  | 
ph }  e.  _V )
13 19.8a 1578 . . . . . . . . 9  |-  ( y  =  { x  | 
ph }  ->  E. y 
y  =  { x  |  ph } )
143, 13syl 14 . . . . . . . 8  |-  ( y  e.  { { x  |  ph } }  ->  E. y  y  =  {
x  |  ph }
)
15 isset 2731 . . . . . . . 8  |-  ( { x  |  ph }  e.  _V  <->  E. y  y  =  { x  |  ph } )
1614, 15sylibr 133 . . . . . . 7  |-  ( y  e.  { { x  |  ph } }  ->  { x  |  ph }  e.  _V )
1712, 16nsyl3 616 . . . . . 6  |-  ( y  e.  { { x  |  ph } }  ->  -. 
ph )
18 vex 2728 . . . . . . . . . 10  |-  y  e. 
_V
19 biidd 171 . . . . . . . . . 10  |-  ( x  =  y  ->  ( ph 
<-> 
ph ) )
2018, 19elab 2869 . . . . . . . . 9  |-  ( y  e.  { x  | 
ph }  <->  ph )
2120notbii 658 . . . . . . . 8  |-  ( -.  y  e.  { x  |  ph }  <->  -.  ph )
2221biimpri 132 . . . . . . 7  |-  ( -. 
ph  ->  -.  y  e.  { x  |  ph }
)
2322eq0rdv 3452 . . . . . 6  |-  ( -. 
ph  ->  { x  | 
ph }  =  (/) )
2417, 23syl 14 . . . . 5  |-  ( y  e.  { { x  |  ph } }  ->  { x  |  ph }  =  (/) )
253, 24eqtrd 2198 . . . 4  |-  ( y  e.  { { x  |  ph } }  ->  y  =  (/) )
26 0lt1o 6404 . . . 4  |-  (/)  e.  1o
2725, 26eqeltrdi 2256 . . 3  |-  ( y  e.  { { x  |  ph } }  ->  y  e.  1o )
2827ssriv 3145 . 2  |-  { {
x  |  ph } }  C_  1o
292, 28ssexi 4119 1  |-  { {
x  |  ph } }  e.  _V
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 104    = wceq 1343   E.wex 1480    e. wcel 2136   {cab 2151   _Vcvv 2725   (/)c0 3408   {csn 3575   Oncon0 4340   1oc1o 6373
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-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4099  ax-nul 4107  ax-pow 4152  ax-pr 4186  ax-un 4410
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2296  df-ral 2448  df-rex 2449  df-v 2727  df-dif 3117  df-un 3119  df-in 3121  df-ss 3128  df-nul 3409  df-pw 3560  df-sn 3581  df-pr 3582  df-uni 3789  df-tr 4080  df-iord 4343  df-on 4345  df-suc 4348  df-1o 6380
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator