| Mathbox for Jim Kingdon |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > exmidsbth | GIF version | ||
| Description: The Schroeder-Bernstein
Theorem is equivalent to excluded middle. This
is Metamath 100 proof #25. The forward direction (isbth 7097) 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 7097.
The reverse direction (exmidsbthr 16272) 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.) |
| Ref | Expression |
|---|---|
| exmidsbth | ⊢ (EXMID ↔ ∀𝑥∀𝑦((𝑥 ≼ 𝑦 ∧ 𝑦 ≼ 𝑥) → 𝑥 ≈ 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isbth 7097 | . . . 4 ⊢ ((EXMID ∧ (𝑥 ≼ 𝑦 ∧ 𝑦 ≼ 𝑥)) → 𝑥 ≈ 𝑦) | |
| 2 | 1 | ex 115 | . . 3 ⊢ (EXMID → ((𝑥 ≼ 𝑦 ∧ 𝑦 ≼ 𝑥) → 𝑥 ≈ 𝑦)) |
| 3 | 2 | alrimivv 1899 | . 2 ⊢ (EXMID → ∀𝑥∀𝑦((𝑥 ≼ 𝑦 ∧ 𝑦 ≼ 𝑥) → 𝑥 ≈ 𝑦)) |
| 4 | exmidsbthr 16272 | . 2 ⊢ (∀𝑥∀𝑦((𝑥 ≼ 𝑦 ∧ 𝑦 ≼ 𝑥) → 𝑥 ≈ 𝑦) → EXMID) | |
| 5 | 3, 4 | impbii 126 | 1 ⊢ (EXMID ↔ ∀𝑥∀𝑦((𝑥 ≼ 𝑦 ∧ 𝑦 ≼ 𝑥) → 𝑥 ≈ 𝑦)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∀wal 1371 class class class wbr 4060 EXMIDwem 4255 ≈ cen 6850 ≼ cdom 6851 |
| 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-13 2180 ax-14 2181 ax-ext 2189 ax-coll 4176 ax-sep 4179 ax-nul 4187 ax-pow 4235 ax-pr 4270 ax-un 4499 ax-setind 4604 ax-iinf 4655 |
| This theorem depends on definitions: df-bi 117 df-stab 833 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-ral 2491 df-rex 2492 df-reu 2493 df-rab 2495 df-v 2779 df-sbc 3007 df-csb 3103 df-dif 3177 df-un 3179 df-in 3181 df-ss 3188 df-nul 3470 df-if 3581 df-pw 3629 df-sn 3650 df-pr 3651 df-op 3653 df-uni 3866 df-int 3901 df-iun 3944 df-br 4061 df-opab 4123 df-mpt 4124 df-tr 4160 df-exmid 4256 df-id 4359 df-iord 4432 df-on 4434 df-suc 4437 df-iom 4658 df-xp 4700 df-rel 4701 df-cnv 4702 df-co 4703 df-dm 4704 df-rn 4705 df-res 4706 df-ima 4707 df-iota 5252 df-fun 5293 df-fn 5294 df-f 5295 df-f1 5296 df-fo 5297 df-f1o 5298 df-fv 5299 df-ov 5972 df-oprab 5973 df-mpo 5974 df-1st 6251 df-2nd 6252 df-1o 6527 df-2o 6528 df-map 6762 df-en 6853 df-dom 6854 df-dju 7168 df-inl 7177 df-inr 7178 df-case 7214 df-nninf 7250 df-omni 7265 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |