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

Theorem rex2dom 7063
Description: A set that has at least 2 different members dominates ordinal 2. (Contributed by BTernaryTau, 30-Dec-2024.)
Assertion
Ref Expression
rex2dom  |-  ( ( A  e.  V  /\  E. x  e.  A  E. y  e.  A  x  =/=  y )  ->  2o  ~<_  A )
Distinct variable group:    x, A, y
Allowed substitution hints:    V( x, y)

Proof of Theorem rex2dom
StepHypRef Expression
1 elex 2825 . . 3  |-  ( A  e.  V  ->  A  e.  _V )
2 prssi 3852 . . . . . 6  |-  ( ( x  e.  A  /\  y  e.  A )  ->  { x ,  y }  C_  A )
3 df2o3 6662 . . . . . . . 8  |-  2o  =  { (/) ,  1o }
4 0ex 4237 . . . . . . . . . 10  |-  (/)  e.  _V
54a1i 9 . . . . . . . . 9  |-  ( x  =/=  y  ->  (/)  e.  _V )
6 1oex 6655 . . . . . . . . . 10  |-  1o  e.  _V
76a1i 9 . . . . . . . . 9  |-  ( x  =/=  y  ->  1o  e.  _V )
8 vex 2816 . . . . . . . . . 10  |-  x  e. 
_V
98a1i 9 . . . . . . . . 9  |-  ( x  =/=  y  ->  x  e.  _V )
10 vex 2816 . . . . . . . . . 10  |-  y  e. 
_V
1110a1i 9 . . . . . . . . 9  |-  ( x  =/=  y  ->  y  e.  _V )
12 1n0 6665 . . . . . . . . . . 11  |-  1o  =/=  (/)
1312necomi 2497 . . . . . . . . . 10  |-  (/)  =/=  1o
1413a1i 9 . . . . . . . . 9  |-  ( x  =/=  y  ->  (/)  =/=  1o )
15 id 19 . . . . . . . . 9  |-  ( x  =/=  y  ->  x  =/=  y )
165, 7, 9, 11, 14, 15en2prd 7059 . . . . . . . 8  |-  ( x  =/=  y  ->  { (/) ,  1o }  ~~  {
x ,  y } )
173, 16eqbrtrid 4144 . . . . . . 7  |-  ( x  =/=  y  ->  2o  ~~ 
{ x ,  y } )
18 endom 7002 . . . . . . 7  |-  ( 2o 
~~  { x ,  y }  ->  2o  ~<_  { x ,  y } )
1917, 18syl 14 . . . . . 6  |-  ( x  =/=  y  ->  2o  ~<_  { x ,  y } )
20 domssr 7017 . . . . . . 7  |-  ( ( A  e.  _V  /\  { x ,  y } 
C_  A  /\  2o  ~<_  { x ,  y } )  ->  2o  ~<_  A )
21203expib 1233 . . . . . 6  |-  ( A  e.  _V  ->  (
( { x ,  y }  C_  A  /\  2o  ~<_  { x ,  y } )  ->  2o 
~<_  A ) )
222, 19, 21syl2ani 408 . . . . 5  |-  ( A  e.  _V  ->  (
( ( x  e.  A  /\  y  e.  A )  /\  x  =/=  y )  ->  2o  ~<_  A ) )
2322expd 258 . . . 4  |-  ( A  e.  _V  ->  (
( x  e.  A  /\  y  e.  A
)  ->  ( x  =/=  y  ->  2o  ~<_  A ) ) )
2423rexlimdvv 2667 . . 3  |-  ( A  e.  _V  ->  ( E. x  e.  A  E. y  e.  A  x  =/=  y  ->  2o  ~<_  A ) )
251, 24syl 14 . 2  |-  ( A  e.  V  ->  ( E. x  e.  A  E. y  e.  A  x  =/=  y  ->  2o  ~<_  A ) )
2625imp 124 1  |-  ( ( A  e.  V  /\  E. x  e.  A  E. y  e.  A  x  =/=  y )  ->  2o  ~<_  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2203    =/= wne 2412   E.wrex 2521   _Vcvv 2813    C_ wss 3211   (/)c0 3508   {cpr 3690   class class class wbr 4109   1oc1o 6640   2oc2o 6641    ~~ cen 6973    ~<_ cdom 6974
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-v 2815  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-1o 6647  df-2o 6648  df-en 6976  df-dom 6977
This theorem is referenced by:  hashdmprop2dom  11216  fun2dmnop0  11222
  Copyright terms: Public domain W3C validator