ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  pitoregt0 GIF version

Theorem pitoregt0 7790
Description: Embedding from N to yields a number greater than zero. (Contributed by Jim Kingdon, 15-Jul-2021.)
Assertion
Ref Expression
pitoregt0 (𝑁N → 0 < ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
Distinct variable group:   𝑁,𝑙,𝑢

Proof of Theorem pitoregt0
StepHypRef Expression
1 1pr 7495 . . . . . 6 1PP
2 addclpr 7478 . . . . . 6 ((1PP ∧ 1PP) → (1P +P 1P) ∈ P)
31, 1, 2mp2an 423 . . . . 5 (1P +P 1P) ∈ P
4 nnprlu 7494 . . . . 5 (𝑁N → ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ ∈ P)
5 ltaddpr 7538 . . . . 5 (((1P +P 1P) ∈ P ∧ ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ ∈ P) → (1P +P 1P)<P ((1P +P 1P) +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩))
63, 4, 5sylancr 411 . . . 4 (𝑁N → (1P +P 1P)<P ((1P +P 1P) +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩))
71a1i 9 . . . . . 6 (𝑁N → 1PP)
8 addassprg 7520 . . . . . 6 ((1PP ∧ 1PP ∧ ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ ∈ P) → ((1P +P 1P) +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩) = (1P +P (1P +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩)))
97, 7, 4, 8syl3anc 1228 . . . . 5 (𝑁N → ((1P +P 1P) +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩) = (1P +P (1P +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩)))
10 addcomprg 7519 . . . . . . 7 ((1PP ∧ ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ ∈ P) → (1P +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩) = (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P))
111, 4, 10sylancr 411 . . . . . 6 (𝑁N → (1P +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩) = (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P))
1211oveq2d 5858 . . . . 5 (𝑁N → (1P +P (1P +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩)) = (1P +P (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P)))
139, 12eqtrd 2198 . . . 4 (𝑁N → ((1P +P 1P) +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩) = (1P +P (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P)))
146, 13breqtrd 4008 . . 3 (𝑁N → (1P +P 1P)<P (1P +P (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P)))
15 addclpr 7478 . . . . 5 ((⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ ∈ P ∧ 1PP) → (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P) ∈ P)
164, 1, 15sylancl 410 . . . 4 (𝑁N → (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P) ∈ P)
17 ltsrprg 7688 . . . . 5 (((1PP ∧ 1PP) ∧ ((⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P) ∈ P ∧ 1PP)) → ([⟨1P, 1P⟩] ~R <R [⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R ↔ (1P +P 1P)<P (1P +P (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P))))
181, 1, 17mpanl12 433 . . . 4 (((⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P) ∈ P ∧ 1PP) → ([⟨1P, 1P⟩] ~R <R [⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R ↔ (1P +P 1P)<P (1P +P (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P))))
1916, 1, 18sylancl 410 . . 3 (𝑁N → ([⟨1P, 1P⟩] ~R <R [⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R ↔ (1P +P 1P)<P (1P +P (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P))))
2014, 19mpbird 166 . 2 (𝑁N → [⟨1P, 1P⟩] ~R <R [⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
21 df-0 7760 . . . 4 0 = ⟨0R, 0R
2221breq1i 3989 . . 3 (0 < ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ ↔ ⟨0R, 0R⟩ < ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
23 ltresr 7780 . . 3 (⟨0R, 0R⟩ < ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ ↔ 0R <R [⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
24 df-0r 7672 . . . 4 0R = [⟨1P, 1P⟩] ~R
2524breq1i 3989 . . 3 (0R <R [⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R ↔ [⟨1P, 1P⟩] ~R <R [⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
2622, 23, 253bitri 205 . 2 (0 < ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ ↔ [⟨1P, 1P⟩] ~R <R [⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
2720, 26sylibr 133 1 (𝑁N → 0 < ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104   = wceq 1343  wcel 2136  {cab 2151  cop 3579   class class class wbr 3982  (class class class)co 5842  1oc1o 6377  [cec 6499  Ncnpi 7213   ~Q ceq 7220   <Q cltq 7226  Pcnp 7232  1Pc1p 7233   +P cpp 7234  <P cltp 7236   ~R cer 7237  0Rc0r 7239   <R cltr 7244  0cc0 7753   < cltrr 7757
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-eprel 4267  df-id 4271  df-po 4274  df-iso 4275  df-iord 4344  df-on 4346  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-irdg 6338  df-1o 6384  df-2o 6385  df-oadd 6388  df-omul 6389  df-er 6501  df-ec 6503  df-qs 6507  df-ni 7245  df-pli 7246  df-mi 7247  df-lti 7248  df-plpq 7285  df-mpq 7286  df-enq 7288  df-nqqs 7289  df-plqqs 7290  df-mqqs 7291  df-1nqqs 7292  df-rq 7293  df-ltnqqs 7294  df-enq0 7365  df-nq0 7366  df-0nq0 7367  df-plq0 7368  df-mq0 7369  df-inp 7407  df-i1p 7408  df-iplp 7409  df-iltp 7411  df-enr 7667  df-nr 7668  df-ltr 7671  df-0r 7672  df-0 7760  df-r 7763  df-lt 7766
This theorem is referenced by:  recriota  7831
  Copyright terms: Public domain W3C validator