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 6530 | . . . . 5 ⊢ 1𝑜 <N (1𝑜 +N 1𝑜) | |
2 | 1pi 6505 | . . . . . 6 ⊢ 1𝑜 ∈ N | |
3 | mulidpi 6508 | . . . . . 6 ⊢ (1𝑜 ∈ N → (1𝑜 ·N 1𝑜) = 1𝑜) | |
4 | 2, 3 | ax-mp 7 | . . . . 5 ⊢ (1𝑜 ·N 1𝑜) = 1𝑜 |
5 | 4, 4 | oveq12i 5544 | . . . . 5 ⊢ ((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)) = (1𝑜 +N 1𝑜) |
6 | 1, 4, 5 | 3brtr4i 3813 | . . . 4 ⊢ (1𝑜 ·N 1𝑜) <N ((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)) |
7 | mulclpi 6518 | . . . . . 6 ⊢ ((1𝑜 ∈ N ∧ 1𝑜 ∈ N) → (1𝑜 ·N 1𝑜) ∈ N) | |
8 | 2, 2, 7 | mp2an 416 | . . . . 5 ⊢ (1𝑜 ·N 1𝑜) ∈ N |
9 | addclpi 6517 | . . . . . 6 ⊢ (((1𝑜 ·N 1𝑜) ∈ N ∧ (1𝑜 ·N 1𝑜) ∈ N) → ((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)) ∈ N) | |
10 | 8, 8, 9 | mp2an 416 | . . . . 5 ⊢ ((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)) ∈ N |
11 | ltmpig 6529 | . . . . 5 ⊢ (((1𝑜 ·N 1𝑜) ∈ N ∧ ((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)) ∈ N ∧ 1𝑜 ∈ N) → ((1𝑜 ·N 1𝑜) <N ((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)) ↔ (1𝑜 ·N (1𝑜 ·N 1𝑜)) <N (1𝑜 ·N ((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜))))) | |
12 | 8, 10, 2, 11 | mp3an 1268 | . . . 4 ⊢ ((1𝑜 ·N 1𝑜) <N ((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)) ↔ (1𝑜 ·N (1𝑜 ·N 1𝑜)) <N (1𝑜 ·N ((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)))) |
13 | 6, 12 | mpbi 143 | . . 3 ⊢ (1𝑜 ·N (1𝑜 ·N 1𝑜)) <N (1𝑜 ·N ((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜))) |
14 | ordpipqqs 6564 | . . . 4 ⊢ (((1𝑜 ∈ N ∧ 1𝑜 ∈ N) ∧ (((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)) ∈ N ∧ (1𝑜 ·N 1𝑜) ∈ N)) → ([〈1𝑜, 1𝑜〉] ~Q <Q [〈((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)), (1𝑜 ·N 1𝑜)〉] ~Q ↔ (1𝑜 ·N (1𝑜 ·N 1𝑜)) <N (1𝑜 ·N ((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜))))) | |
15 | 2, 2, 10, 8, 14 | mp4an 417 | . . 3 ⊢ ([〈1𝑜, 1𝑜〉] ~Q <Q [〈((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)), (1𝑜 ·N 1𝑜)〉] ~Q ↔ (1𝑜 ·N (1𝑜 ·N 1𝑜)) <N (1𝑜 ·N ((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)))) |
16 | 13, 15 | mpbir 144 | . 2 ⊢ [〈1𝑜, 1𝑜〉] ~Q <Q [〈((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)), (1𝑜 ·N 1𝑜)〉] ~Q |
17 | df-1nqqs 6541 | . 2 ⊢ 1Q = [〈1𝑜, 1𝑜〉] ~Q | |
18 | 17, 17 | oveq12i 5544 | . . 3 ⊢ (1Q +Q 1Q) = ([〈1𝑜, 1𝑜〉] ~Q +Q [〈1𝑜, 1𝑜〉] ~Q ) |
19 | addpipqqs 6560 | . . . 4 ⊢ (((1𝑜 ∈ N ∧ 1𝑜 ∈ N) ∧ (1𝑜 ∈ N ∧ 1𝑜 ∈ N)) → ([〈1𝑜, 1𝑜〉] ~Q +Q [〈1𝑜, 1𝑜〉] ~Q ) = [〈((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)), (1𝑜 ·N 1𝑜)〉] ~Q ) | |
20 | 2, 2, 2, 2, 19 | mp4an 417 | . . 3 ⊢ ([〈1𝑜, 1𝑜〉] ~Q +Q [〈1𝑜, 1𝑜〉] ~Q ) = [〈((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)), (1𝑜 ·N 1𝑜)〉] ~Q |
21 | 18, 20 | eqtri 2101 | . 2 ⊢ (1Q +Q 1Q) = [〈((1𝑜 ·N 1𝑜) +N (1𝑜 ·N 1𝑜)), (1𝑜 ·N 1𝑜)〉] ~Q |
22 | 16, 17, 21 | 3brtr4i 3813 | 1 ⊢ 1Q <Q (1Q +Q 1Q) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 103 = wceq 1284 ∈ wcel 1433 〈cop 3401 class class class wbr 3785 (class class class)co 5532 1𝑜c1o 6017 [cec 6127 Ncnpi 6462 +N cpli 6463 ·N cmi 6464 <N clti 6465 ~Q ceq 6469 1Qc1q 6471 +Q cplq 6472 <Q cltq 6475 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-coll 3893 ax-sep 3896 ax-nul 3904 ax-pow 3948 ax-pr 3964 ax-un 4188 ax-setind 4280 ax-iinf 4329 |
This theorem depends on definitions: df-bi 115 df-dc 776 df-3or 920 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-ral 2353 df-rex 2354 df-reu 2355 df-rab 2357 df-v 2603 df-sbc 2816 df-csb 2909 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-nul 3252 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-int 3637 df-iun 3680 df-br 3786 df-opab 3840 df-mpt 3841 df-tr 3876 df-eprel 4044 df-id 4048 df-iord 4121 df-on 4123 df-suc 4126 df-iom 4332 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-rn 4374 df-res 4375 df-ima 4376 df-iota 4887 df-fun 4924 df-fn 4925 df-f 4926 df-f1 4927 df-fo 4928 df-f1o 4929 df-fv 4930 df-ov 5535 df-oprab 5536 df-mpt2 5537 df-1st 5787 df-2nd 5788 df-recs 5943 df-irdg 5980 df-1o 6024 df-oadd 6028 df-omul 6029 df-er 6129 df-ec 6131 df-qs 6135 df-ni 6494 df-pli 6495 df-mi 6496 df-lti 6497 df-plpq 6534 df-enq 6537 df-nqqs 6538 df-plqqs 6539 df-1nqqs 6541 df-ltnqqs 6543 |
This theorem is referenced by: ltaddnq 6597 |
Copyright terms: Public domain | W3C validator |