| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 1lt2nq | GIF version | ||
| Description: One is less than two (one plus one). (Contributed by NM, 13-Mar-1996.) (Revised by Mario Carneiro, 10-May-2013.) |
| Ref | Expression |
|---|---|
| 1lt2nq | ⊢ 1Q <Q (1Q +Q 1Q) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1lt2pi 7701 | . . . . 5 ⊢ 1o <N (1o +N 1o) | |
| 2 | 1pi 7676 | . . . . . 6 ⊢ 1o ∈ N | |
| 3 | mulidpi 7679 | . . . . . 6 ⊢ (1o ∈ N → (1o ·N 1o) = 1o) | |
| 4 | 2, 3 | ax-mp 5 | . . . . 5 ⊢ (1o ·N 1o) = 1o |
| 5 | 4, 4 | oveq12i 6091 | . . . . 5 ⊢ ((1o ·N 1o) +N (1o ·N 1o)) = (1o +N 1o) |
| 6 | 1, 4, 5 | 3brtr4i 4158 | . . . 4 ⊢ (1o ·N 1o) <N ((1o ·N 1o) +N (1o ·N 1o)) |
| 7 | mulclpi 7689 | . . . . . 6 ⊢ ((1o ∈ N ∧ 1o ∈ N) → (1o ·N 1o) ∈ N) | |
| 8 | 2, 2, 7 | mp2an 430 | . . . . 5 ⊢ (1o ·N 1o) ∈ N |
| 9 | addclpi 7688 | . . . . . 6 ⊢ (((1o ·N 1o) ∈ N ∧ (1o ·N 1o) ∈ N) → ((1o ·N 1o) +N (1o ·N 1o)) ∈ N) | |
| 10 | 8, 8, 9 | mp2an 430 | . . . . 5 ⊢ ((1o ·N 1o) +N (1o ·N 1o)) ∈ N |
| 11 | ltmpig 7700 | . . . . 5 ⊢ (((1o ·N 1o) ∈ N ∧ ((1o ·N 1o) +N (1o ·N 1o)) ∈ N ∧ 1o ∈ N) → ((1o ·N 1o) <N ((1o ·N 1o) +N (1o ·N 1o)) ↔ (1o ·N (1o ·N 1o)) <N (1o ·N ((1o ·N 1o) +N (1o ·N 1o))))) | |
| 12 | 8, 10, 2, 11 | mp3an 1378 | . . . 4 ⊢ ((1o ·N 1o) <N ((1o ·N 1o) +N (1o ·N 1o)) ↔ (1o ·N (1o ·N 1o)) <N (1o ·N ((1o ·N 1o) +N (1o ·N 1o)))) |
| 13 | 6, 12 | mpbi 145 | . . 3 ⊢ (1o ·N (1o ·N 1o)) <N (1o ·N ((1o ·N 1o) +N (1o ·N 1o))) |
| 14 | ordpipqqs 7735 | . . . 4 ⊢ (((1o ∈ N ∧ 1o ∈ N) ∧ (((1o ·N 1o) +N (1o ·N 1o)) ∈ N ∧ (1o ·N 1o) ∈ N)) → ([〈1o, 1o〉] ~Q <Q [〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉] ~Q ↔ (1o ·N (1o ·N 1o)) <N (1o ·N ((1o ·N 1o) +N (1o ·N 1o))))) | |
| 15 | 2, 2, 10, 8, 14 | mp4an 431 | . . 3 ⊢ ([〈1o, 1o〉] ~Q <Q [〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉] ~Q ↔ (1o ·N (1o ·N 1o)) <N (1o ·N ((1o ·N 1o) +N (1o ·N 1o)))) |
| 16 | 13, 15 | mpbir 146 | . 2 ⊢ [〈1o, 1o〉] ~Q <Q [〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉] ~Q |
| 17 | df-1nqqs 7712 | . 2 ⊢ 1Q = [〈1o, 1o〉] ~Q | |
| 18 | 17, 17 | oveq12i 6091 | . . 3 ⊢ (1Q +Q 1Q) = ([〈1o, 1o〉] ~Q +Q [〈1o, 1o〉] ~Q ) |
| 19 | addpipqqs 7731 | . . . 4 ⊢ (((1o ∈ N ∧ 1o ∈ N) ∧ (1o ∈ N ∧ 1o ∈ N)) → ([〈1o, 1o〉] ~Q +Q [〈1o, 1o〉] ~Q ) = [〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉] ~Q ) | |
| 20 | 2, 2, 2, 2, 19 | mp4an 431 | . . 3 ⊢ ([〈1o, 1o〉] ~Q +Q [〈1o, 1o〉] ~Q ) = [〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉] ~Q |
| 21 | 18, 20 | eqtri 2259 | . 2 ⊢ (1Q +Q 1Q) = [〈((1o ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉] ~Q |
| 22 | 16, 17, 21 | 3brtr4i 4158 | 1 ⊢ 1Q <Q (1Q +Q 1Q) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 = wceq 1402 ∈ wcel 2209 〈cop 3711 class class class wbr 4128 (class class class)co 6079 1oc1o 6674 [cec 6799 Ncnpi 7633 +N cpli 7634 ·N cmi 7635 <N clti 7636 ~Q ceq 7640 1Qc1q 7642 +Q cplq 7643 <Q cltq 7646 |
| 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 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-coll 4244 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-iinf 4733 |
| This theorem depends on definitions: df-bi 117 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-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-tr 4228 df-eprel 4432 df-id 4436 df-iord 4509 df-on 4511 df-suc 4514 df-iom 4736 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-recs 6570 df-irdg 6635 df-1o 6681 df-oadd 6685 df-omul 6686 df-er 6801 df-ec 6803 df-qs 6807 df-ni 7665 df-pli 7666 df-mi 7667 df-lti 7668 df-plpq 7705 df-enq 7708 df-nqqs 7709 df-plqqs 7710 df-1nqqs 7712 df-ltnqqs 7714 |
| This theorem is referenced by: ltaddnq 7768 |
| Copyright terms: Public domain | W3C validator |