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

Theorem exmidsbth 17069
Description: The Schroeder-Bernstein Theorem is equivalent to excluded middle. This is Metamath 100 proof #25. The forward direction (isbth 7284) is the proof of the Schroeder-Bernstein Theorem from the Metamath Proof Explorer database (in which excluded middle holds), but adapted to use EXMID as an antecedent rather than being unconditionally true, as in the non-intuitionistic proof at https://us.metamath.org/mpeuni/sbth.html 7284.

The reverse direction (exmidsbthr 17068) is the one which establishes that Schroeder-Bernstein implies excluded middle. This resolves the question of whether we will be able to prove Schroeder-Bernstein from our axioms in the negative. (Contributed by Jim Kingdon, 13-Aug-2022.)

Assertion
Ref Expression
exmidsbth  |-  (EXMID  <->  A. x A. y ( ( x  ~<_  y  /\  y  ~<_  x )  ->  x  ~~  y ) )
Distinct variable group:    x, y

Proof of Theorem exmidsbth
StepHypRef Expression
1 isbth 7284 . . . 4  |-  ( (EXMID  /\  ( x  ~<_  y  /\  y  ~<_  x ) )  ->  x  ~~  y
)
21ex 115 . . 3  |-  (EXMID  ->  (
( x  ~<_  y  /\  y  ~<_  x )  ->  x  ~~  y ) )
32alrimivv 1928 . 2  |-  (EXMID  ->  A. x A. y ( ( x  ~<_  y  /\  y  ~<_  x )  ->  x  ~~  y ) )
4 exmidsbthr 17068 . 2  |-  ( A. x A. y ( ( x  ~<_  y  /\  y  ~<_  x )  ->  x  ~~  y )  -> EXMID )
53, 4impbii 126 1  |-  (EXMID  <->  A. x A. y ( ( x  ~<_  y  /\  y  ~<_  x )  ->  x  ~~  y ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1400   class class class wbr 4130  EXMIDwem 4331    ~~ cen 7020    ~<_ 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-13 2211  ax-14 2212  ax-ext 2220  ax-coll 4246  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-stab 843  df-dc 847  df-3or 1010  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-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-exmid 4332  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-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-1o 6687  df-2o 6688  df-map 6924  df-en 7023  df-dom 7024  df-dju 7378  df-inl 7387  df-inr 7388  df-case 7424  df-nninf 7460  df-omni 7475
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator