| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nohalf | Structured version Visualization version GIF version | ||
| Description: An explicit expression for one half. This theorem avoids the axiom of infinity. (Contributed by Scott Fenton, 23-Jul-2025.) |
| Ref | Expression |
|---|---|
| nohalf | ⊢ ( 1s /su 2s) = ({ 0s } |s { 1s }) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | twocut 28493 | . . 3 ⊢ (2s ·s ({ 0s } |s { 1s })) = 1s | |
| 2 | 1no 27880 | . . . . 5 ⊢ 1s ∈ No | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (⊤ → 1s ∈ No ) |
| 4 | 0no 27879 | . . . . . . 7 ⊢ 0s ∈ No | |
| 5 | 4 | a1i 11 | . . . . . 6 ⊢ (⊤ → 0s ∈ No ) |
| 6 | 0lt1s 27882 | . . . . . . 7 ⊢ 0s <s 1s | |
| 7 | 6 | a1i 11 | . . . . . 6 ⊢ (⊤ → 0s <s 1s ) |
| 8 | 5, 3, 7 | sltssn 27840 | . . . . 5 ⊢ (⊤ → { 0s } <<s { 1s }) |
| 9 | 8 | cutscld 27853 | . . . 4 ⊢ (⊤ → ({ 0s } |s { 1s }) ∈ No ) |
| 10 | 2no 28489 | . . . . 5 ⊢ 2s ∈ No | |
| 11 | 10 | a1i 11 | . . . 4 ⊢ (⊤ → 2s ∈ No ) |
| 12 | 2ne0s 28490 | . . . . 5 ⊢ 2s ≠ 0s | |
| 13 | 12 | a1i 11 | . . . 4 ⊢ (⊤ → 2s ≠ 0s ) |
| 14 | oveq2 7400 | . . . . . 6 ⊢ (𝑥 = ({ 0s } |s { 1s }) → (2s ·s 𝑥) = (2s ·s ({ 0s } |s { 1s }))) | |
| 15 | 14 | eqeq1d 2763 | . . . . 5 ⊢ (𝑥 = ({ 0s } |s { 1s }) → ((2s ·s 𝑥) = 1s ↔ (2s ·s ({ 0s } |s { 1s })) = 1s )) |
| 16 | 1 | a1i 11 | . . . . 5 ⊢ (⊤ → (2s ·s ({ 0s } |s { 1s })) = 1s ) |
| 17 | 15, 9, 16 | rspcedvdw 3584 | . . . 4 ⊢ (⊤ → ∃𝑥 ∈ No (2s ·s 𝑥) = 1s ) |
| 18 | 3, 9, 11, 13, 17 | divmulswd 28264 | . . 3 ⊢ (⊤ → (( 1s /su 2s) = ({ 0s } |s { 1s }) ↔ (2s ·s ({ 0s } |s { 1s })) = 1s )) |
| 19 | 1, 18 | mpbiri 260 | . 2 ⊢ (⊤ → ( 1s /su 2s) = ({ 0s } |s { 1s })) |
| 20 | 19 | mptru 1566 | 1 ⊢ ( 1s /su 2s) = ({ 0s } |s { 1s }) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1559 ⊤wtru 1560 ∈ wcel 2141 ≠ wne 2956 {csn 4581 class class class wbr 5099 (class class class)co 7392 No csur 27681 <s clts 27682 |s ccuts 27829 0s c0s 27875 1s c1s 27876 ·s cmuls 28176 /su cdivs 28257 2sc2s 28480 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-ot 4590 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-se 5599 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-1st 7966 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-1o 8432 df-2o 8433 df-nadd 8631 df-no 27684 df-lts 27685 df-bday 27686 df-les 27786 df-slts 27828 df-cuts 27830 df-0s 27877 df-1s 27878 df-made 27897 df-old 27898 df-left 27900 df-right 27901 df-norec 28008 df-norec2 28019 df-adds 28030 df-negs 28091 df-subs 28092 df-muls 28177 df-divs 28258 df-n0s 28384 df-nns 28385 df-2s 28481 |
| This theorem is referenced by: bdaypw2n0bndlem 28533 |
| Copyright terms: Public domain | W3C validator |