Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  pw1ndom3 Unicode version

Theorem pw1ndom3 17020
Description: The powerset of  1o does not dominate  3o. This is another way of saying that  ~P 1o does not have three elements (like pwntru 4336). (Contributed by Steven Nguyen and Jim Kingdon, 14-Feb-2026.)
Assertion
Ref Expression
pw1ndom3  |-  -.  3o  ~<_  ~P 1o

Proof of Theorem pw1ndom3
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 3dom 17018 . . 3  |-  ( 3o  ~<_  ~P 1o  ->  E. x  e.  ~P  1o E. y  e.  ~P  1o E. z  e.  ~P  1o ( x  =/=  y  /\  x  =/=  z  /\  y  =/=  z ) )
2 simp-4r 548 . . . . . . . . . 10  |-  ( ( ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  /\  z  e.  ~P 1o )  /\  (
x  =/=  y  /\  x  =/=  z  /\  y  =/=  z ) )  ->  x  e.  ~P 1o )
3 simpllr 540 . . . . . . . . . 10  |-  ( ( ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  /\  z  e.  ~P 1o )  /\  (
x  =/=  y  /\  x  =/=  z  /\  y  =/=  z ) )  -> 
y  e.  ~P 1o )
4 simplr 533 . . . . . . . . . 10  |-  ( ( ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  /\  z  e.  ~P 1o )  /\  (
x  =/=  y  /\  x  =/=  z  /\  y  =/=  z ) )  -> 
z  e.  ~P 1o )
5 simpr1 1034 . . . . . . . . . 10  |-  ( ( ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  /\  z  e.  ~P 1o )  /\  (
x  =/=  y  /\  x  =/=  z  /\  y  =/=  z ) )  ->  x  =/=  y )
6 simpr2 1035 . . . . . . . . . 10  |-  ( ( ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  /\  z  e.  ~P 1o )  /\  (
x  =/=  y  /\  x  =/=  z  /\  y  =/=  z ) )  ->  x  =/=  z )
7 simpr3 1036 . . . . . . . . . 10  |-  ( ( ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  /\  z  e.  ~P 1o )  /\  (
x  =/=  y  /\  x  =/=  z  /\  y  =/=  z ) )  -> 
y  =/=  z )
82, 3, 4, 5, 6, 7pw1ndom3lem 17019 . . . . . . . . 9  |-  ( ( ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  /\  z  e.  ~P 1o )  /\  (
x  =/=  y  /\  x  =/=  z  /\  y  =/=  z ) )  ->  x  =  (/) )
95necomd 2506 . . . . . . . . . 10  |-  ( ( ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  /\  z  e.  ~P 1o )  /\  (
x  =/=  y  /\  x  =/=  z  /\  y  =/=  z ) )  -> 
y  =/=  x )
103, 2, 4, 9, 7, 6pw1ndom3lem 17019 . . . . . . . . 9  |-  ( ( ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  /\  z  e.  ~P 1o )  /\  (
x  =/=  y  /\  x  =/=  z  /\  y  =/=  z ) )  -> 
y  =  (/) )
118, 10eqtr4d 2274 . . . . . . . 8  |-  ( ( ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  /\  z  e.  ~P 1o )  /\  (
x  =/=  y  /\  x  =/=  z  /\  y  =/=  z ) )  ->  x  =  y )
1211, 5pm2.21ddne 2503 . . . . . . 7  |-  ( ( ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  /\  z  e.  ~P 1o )  /\  (
x  =/=  y  /\  x  =/=  z  /\  y  =/=  z ) )  -> F.  )
1312ex 115 . . . . . 6  |-  ( ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  /\  z  e.  ~P 1o )  -> 
( ( x  =/=  y  /\  x  =/=  z  /\  y  =/=  z )  -> F.  ) )
1413rexlimdva 2668 . . . . 5  |-  ( ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  /\  y  e.  ~P 1o )  ->  ( E. z  e.  ~P  1o ( x  =/=  y  /\  x  =/=  z  /\  y  =/=  z
)  -> F.  )
)
1514rexlimdva 2668 . . . 4  |-  ( ( 3o  ~<_  ~P 1o  /\  x  e.  ~P 1o )  -> 
( E. y  e. 
~P  1o E. z  e.  ~P  1o ( x  =/=  y  /\  x  =/=  z  /\  y  =/=  z )  -> F.  ) )
1615rexlimdva 2668 . . 3  |-  ( 3o  ~<_  ~P 1o  ->  ( E. x  e.  ~P  1o E. y  e.  ~P  1o E. z  e.  ~P  1o ( x  =/=  y  /\  x  =/=  z  /\  y  =/=  z
)  -> F.  )
)
171, 16mpd 13 . 2  |-  ( 3o  ~<_  ~P 1o  -> F.  )
18 dfnot 1420 . 2  |-  ( -.  3o  ~<_  ~P 1o  <->  ( 3o  ~<_  ~P 1o  -> F.  )
)
1917, 18mpbir 146 1  |-  -.  3o  ~<_  ~P 1o
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    /\ w3a 1009   F. wfal 1407    e. wcel 2209    =/= wne 2420   E.wrex 2529   (/)c0 3520   ~Pcpw 3688   class class class wbr 4130   1oc1o 6680   3oc3o 6682    ~<_ cdom 7021
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  ax-iinf 4735
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  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-sbc 3052  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-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fv 5385  df-1o 6687  df-2o 6688  df-3o 6689  df-dom 7024
This theorem is used by:  pw1ninf  17021
  Copyright terms: Public domain W3C validator