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

Theorem 3nsssucpw1 7595
Description: Negated excluded middle implies that  3o is not a subset of the successor of the power set of 
1o. (Contributed by James E. Hanson and Jim Kingdon, 31-Jul-2024.)
Assertion
Ref Expression
3nsssucpw1  |-  ( -. EXMID  ->  -.  3o  C_  suc  ~P 1o )

Proof of Theorem 3nsssucpw1
StepHypRef Expression
1 df-3o 6689 . . . . . 6  |-  3o  =  suc  2o
21sseq1i 3274 . . . . 5  |-  ( 3o  C_  suc  ~P 1o  <->  suc  2o  C_  suc  ~P 1o )
3 1lt2o 6715 . . . . . . . . 9  |-  1o  e.  2o
4 ssnel 4716 . . . . . . . . 9  |-  ( 2o  C_  1o  ->  -.  1o  e.  2o )
53, 4mt2 649 . . . . . . . 8  |-  -.  2o  C_  1o
6 2onn 6794 . . . . . . . . . 10  |-  2o  e.  om
76elexi 2834 . . . . . . . . 9  |-  2o  e.  _V
87elpw 3694 . . . . . . . 8  |-  ( 2o  e.  ~P 1o  <->  2o  C_  1o )
95, 8mtbir 682 . . . . . . 7  |-  -.  2o  e.  ~P 1o
109a1i 9 . . . . . 6  |-  ( suc 
2o  C_  suc  ~P 1o  ->  -.  2o  e.  ~P 1o )
11 sucssel 4569 . . . . . . . . 9  |-  ( 2o  e.  om  ->  ( suc  2o  C_  suc  ~P 1o  ->  2o  e.  suc  ~P 1o ) )
126, 11ax-mp 5 . . . . . . . 8  |-  ( suc 
2o  C_  suc  ~P 1o  ->  2o  e.  suc  ~P 1o )
13 elsuci 4548 . . . . . . . 8  |-  ( 2o  e.  suc  ~P 1o  ->  ( 2o  e.  ~P 1o  \/  2o  =  ~P 1o ) )
1412, 13syl 14 . . . . . . 7  |-  ( suc 
2o  C_  suc  ~P 1o  ->  ( 2o  e.  ~P 1o  \/  2o  =  ~P 1o ) )
1514orcomd 741 . . . . . 6  |-  ( suc 
2o  C_  suc  ~P 1o  ->  ( 2o  =  ~P 1o  \/  2o  e.  ~P 1o ) )
1610, 15ecased 1390 . . . . 5  |-  ( suc 
2o  C_  suc  ~P 1o  ->  2o  =  ~P 1o )
172, 16sylbi 121 . . . 4  |-  ( 3o  C_  suc  ~P 1o  ->  2o  =  ~P 1o )
1817eqcomd 2244 . . 3  |-  ( 3o  C_  suc  ~P 1o  ->  ~P 1o  =  2o )
19 exmidpweq 7216 . . 3  |-  (EXMID  <->  ~P 1o  =  2o )
2018, 19sylibr 134 . 2  |-  ( 3o  C_  suc  ~P 1o  -> EXMID )
2120con3i 641 1  |-  ( -. EXMID  ->  -.  3o  C_  suc  ~P 1o )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    \/ wo 720    = wceq 1402    e. wcel 2209    C_ wss 3220   ~Pcpw 3688  EXMIDwem 4331   suc csuc 4510   omcom 4737   1oc1o 6680   2oc2o 6681   3oc3o 6682
This proof depends on 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-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-dc 847  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  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 3715  df-pr 3716  df-uni 3936  df-int 3971  df-tr 4230  df-exmid 4332  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-1o 6687  df-2o 6688  df-3o 6689
This theorem is used by:  onntri45  7600
  Copyright terms: Public domain W3C validator