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

Theorem ss1o0el1o 7036
Description: Reformulation of ss1o0el1 4257 using  1o instead of 
{ (/) }. (Contributed by BJ, 9-Aug-2024.)
Assertion
Ref Expression
ss1o0el1o  |-  ( A 
C_  1o  ->  ( (/)  e.  A  <->  A  =  1o ) )

Proof of Theorem ss1o0el1o
StepHypRef Expression
1 df1o2 6538 . . . 4  |-  1o  =  { (/) }
21eqcomi 2211 . . 3  |-  { (/) }  =  1o
32sseq2i 3228 . 2  |-  ( A 
C_  { (/) }  <->  A  C_  1o )
4 ss1o0el1 4257 . . 3  |-  ( A 
C_  { (/) }  ->  (
(/)  e.  A  <->  A  =  { (/) } ) )
52eqeq2i 2218 . . 3  |-  ( A  =  { (/) }  <->  A  =  1o )
64, 5bitrdi 196 . 2  |-  ( A 
C_  { (/) }  ->  (
(/)  e.  A  <->  A  =  1o ) )
73, 6sylbir 135 1  |-  ( A 
C_  1o  ->  ( (/)  e.  A  <->  A  =  1o ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1373    e. wcel 2178    C_ wss 3174   (/)c0 3468   {csn 3643   1oc1o 6518
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189  ax-nul 4186
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-v 2778  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-sn 3649  df-suc 4436  df-1o 6525
This theorem is referenced by:  pw1dc1  7037
  Copyright terms: Public domain W3C validator