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

Theorem pitonnlem1 6921
Description: Lemma for pitonn 6924. Two ways to write the number one. (Contributed by Jim Kingdon, 24-Apr-2020.)
Assertion
Ref Expression
pitonnlem1 ⟨[⟨(⟨{𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ = 1
Distinct variable group:   𝑢,𝑙

Proof of Theorem pitonnlem1
StepHypRef Expression
1 df-1 6897 . 2 1 = ⟨1R, 0R
2 df-1r 6817 . . . 4 1R = [⟨(1P +P 1P), 1P⟩] ~R
3 df-i1p 6565 . . . . . . . 8 1P = ⟨{𝑙𝑙 <Q 1Q}, {𝑢 ∣ 1Q <Q 𝑢}⟩
4 df-1nqqs 6449 . . . . . . . . . . 11 1Q = [⟨1𝑜, 1𝑜⟩] ~Q
54breq2i 3772 . . . . . . . . . 10 (𝑙 <Q 1Q𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q )
65abbii 2153 . . . . . . . . 9 {𝑙𝑙 <Q 1Q} = {𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }
74breq1i 3771 . . . . . . . . . 10 (1Q <Q 𝑢 ↔ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢)
87abbii 2153 . . . . . . . . 9 {𝑢 ∣ 1Q <Q 𝑢} = {𝑢 ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢}
96, 8opeq12i 3554 . . . . . . . 8 ⟨{𝑙𝑙 <Q 1Q}, {𝑢 ∣ 1Q <Q 𝑢}⟩ = ⟨{𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢}⟩
103, 9eqtri 2060 . . . . . . 7 1P = ⟨{𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢}⟩
1110oveq1i 5522 . . . . . 6 (1P +P 1P) = (⟨{𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P)
1211opeq1i 3552 . . . . 5 ⟨(1P +P 1P), 1P⟩ = ⟨(⟨{𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P
13 eceq1 6141 . . . . 5 (⟨(1P +P 1P), 1P⟩ = ⟨(⟨{𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩ → [⟨(1P +P 1P), 1P⟩] ~R = [⟨(⟨{𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
1412, 13ax-mp 7 . . . 4 [⟨(1P +P 1P), 1P⟩] ~R = [⟨(⟨{𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R
152, 14eqtri 2060 . . 3 1R = [⟨(⟨{𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R
1615opeq1i 3552 . 2 ⟨1R, 0R⟩ = ⟨[⟨(⟨{𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R
171, 16eqtr2i 2061 1 ⟨[⟨(⟨{𝑙𝑙 <Q [⟨1𝑜, 1𝑜⟩] ~Q }, {𝑢 ∣ [⟨1𝑜, 1𝑜⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ = 1
Colors of variables: wff set class
Syntax hints:   = wceq 1243  {cab 2026  cop 3378   class class class wbr 3764  (class class class)co 5512  1𝑜c1o 5994  [cec 6104   ~Q ceq 6377  1Qc1q 6379   <Q cltq 6383  1Pc1p 6390   +P cpp 6391   ~R cer 6394  0Rc0r 6396  1Rc1r 6397  1c1 6890
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rex 2312  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-xp 4351  df-cnv 4353  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fv 4910  df-ov 5515  df-ec 6108  df-1nqqs 6449  df-i1p 6565  df-1r 6817  df-1 6897
This theorem is referenced by:  pitonn  6924
  Copyright terms: Public domain W3C validator