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

Theorem pitoregt0 8216
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 7921 . . . . . 6 1PP
2 addclpr 7904 . . . . . 6 ((1PP ∧ 1PP) → (1P +P 1P) ∈ P)
31, 1, 2mp2an 430 . . . . 5 (1P +P 1P) ∈ P
4 nnprlu 7920 . . . . 5 (𝑁N → ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ ∈ P)
5 ltaddpr 7964 . . . . 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 418 . . . 4 (𝑁N → (1P +P 1P)<P ((1P +P 1P) +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩))
71a1i 9 . . . . . 6 (𝑁N → 1PP)
8 addassprg 7946 . . . . . 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 1278 . . . . 5 (𝑁N → ((1P +P 1P) +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩) = (1P +P (1P +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩)))
10 addcomprg 7945 . . . . . . 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 418 . . . . . 6 (𝑁N → (1P +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩) = (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P))
1211oveq2d 6101 . . . . 5 (𝑁N → (1P +P (1P +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩)) = (1P +P (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P)))
139, 12eqtrd 2271 . . . 4 (𝑁N → ((1P +P 1P) +P ⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩) = (1P +P (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P)))
146, 13breqtrd 4156 . . 3 (𝑁N → (1P +P 1P)<P (1P +P (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P)))
15 addclpr 7904 . . . . 5 ((⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ ∈ P ∧ 1PP) → (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P) ∈ P)
164, 1, 15sylancl 417 . . . 4 (𝑁N → (⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P) ∈ P)
17 ltsrprg 8114 . . . . 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 440 . . . 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 417 . . 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 167 . 2 (𝑁N → [⟨1P, 1P⟩] ~R <R [⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
21 df-0 8186 . . . 4 0 = ⟨0R, 0R
2221breq1i 4137 . . 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 8206 . . 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 8098 . . . 4 0R = [⟨1P, 1P⟩] ~R
2524breq1i 4137 . . 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 206 . 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 134 1 (𝑁N → 0 < ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105   = wceq 1402  wcel 2209  {cab 2224  cop 3712   class class class wbr 4130  (class class class)co 6085  1oc1o 6680  [cec 6805  Ncnpi 7639   ~Q ceq 7646   <Q cltq 7652  Pcnp 7658  1Pc1p 7659   +P cpp 7660  <P cltp 7662   ~R cer 7663  0Rc0r 7665   <R cltr 7670  0cc0 8179   < cltrr 8183
This proof depends on 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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735
This proof 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 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-2o 6688  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-pli 7672  df-mi 7673  df-lti 7674  df-plpq 7711  df-mpq 7712  df-enq 7714  df-nqqs 7715  df-plqqs 7716  df-mqqs 7717  df-1nqqs 7718  df-rq 7719  df-ltnqqs 7720  df-enq0 7791  df-nq0 7792  df-0nq0 7793  df-plq0 7794  df-mq0 7795  df-inp 7833  df-i1p 7834  df-iplp 7835  df-iltp 7837  df-enr 8093  df-nr 8094  df-ltr 8097  df-0r 8098  df-0 8186  df-r 8189  df-lt 8192
This theorem is used by:  recriota  8257
  Copyright terms: Public domain W3C validator