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

Theorem ltrenn 6931
 Description: Ordering of natural numbers with
Assertion
Ref Expression
ltrenn (𝐽 <N 𝐾 → ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝐽, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝐽, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ < ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝐾, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝐾, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
Distinct variable groups:   𝐽,𝑙   𝑢,𝐽   𝐾,𝑙   𝑢,𝐾

Proof of Theorem ltrenn
StepHypRef Expression
1 ltrelpi 6422 . . 3 <N ⊆ (N × N)
21brel 4392 . 2 (𝐽 <N 𝐾 → (𝐽N𝐾N))
3 ltrennb 6930 . . 3 ((𝐽N𝐾N) → (𝐽 <N 𝐾 ↔ ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝐽, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝐽, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ < ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝐾, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝐾, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩))
43biimpd 132 . 2 ((𝐽N𝐾N) → (𝐽 <N 𝐾 → ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝐽, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝐽, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ < ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝐾, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝐾, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩))
52, 4mpcom 32 1 (𝐽 <N 𝐾 → ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝐽, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝐽, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ < ⟨[⟨(⟨{𝑙𝑙 <Q [⟨𝐾, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨𝐾, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩)
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 97   ∈ wcel 1393  {cab 2026  ⟨cop 3378   class class class wbr 3764  (class class class)co 5512  1𝑜c1o 5994  [cec 6104  Ncnpi 6370
 Copyright terms: Public domain W3C validator