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

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

Proof of Theorem pitonnlem1
StepHypRef Expression
1 df-1 8083 . 2 1 = ⟨1R, 0R
2 df-1r 7995 . . . 4 1R = [⟨(1P +P 1P), 1P⟩] ~R
3 df-i1p 7730 . . . . . . . 8 1P = ⟨{𝑙𝑙 <Q 1Q}, {𝑢 ∣ 1Q <Q 𝑢}⟩
4 df-1nqqs 7614 . . . . . . . . . . 11 1Q = [⟨1o, 1o⟩] ~Q
54breq2i 4101 . . . . . . . . . 10 (𝑙 <Q 1Q𝑙 <Q [⟨1o, 1o⟩] ~Q )
65abbii 2347 . . . . . . . . 9 {𝑙𝑙 <Q 1Q} = {𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }
74breq1i 4100 . . . . . . . . . 10 (1Q <Q 𝑢 ↔ [⟨1o, 1o⟩] ~Q <Q 𝑢)
87abbii 2347 . . . . . . . . 9 {𝑢 ∣ 1Q <Q 𝑢} = {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}
96, 8opeq12i 3872 . . . . . . . 8 ⟨{𝑙𝑙 <Q 1Q}, {𝑢 ∣ 1Q <Q 𝑢}⟩ = ⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩
103, 9eqtri 2252 . . . . . . 7 1P = ⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩
1110oveq1i 6038 . . . . . 6 (1P +P 1P) = (⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P)
1211opeq1i 3870 . . . . 5 ⟨(1P +P 1P), 1P⟩ = ⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P
13 eceq1 6780 . . . . 5 (⟨(1P +P 1P), 1P⟩ = ⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩ → [⟨(1P +P 1P), 1P⟩] ~R = [⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R )
1412, 13ax-mp 5 . . . 4 [⟨(1P +P 1P), 1P⟩] ~R = [⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R
152, 14eqtri 2252 . . 3 1R = [⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R
1615opeq1i 3870 . 2 ⟨1R, 0R⟩ = ⟨[⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R
171, 16eqtr2i 2253 1 ⟨[⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ = 1
Colors of variables: wff set class
Syntax hints:   = wceq 1398  {cab 2217  cop 3676   class class class wbr 4093  (class class class)co 6028  1oc1o 6618  [cec 6743   ~Q ceq 7542  1Qc1q 7544   <Q cltq 7548  1Pc1p 7555   +P cpp 7556   ~R cer 7559  0Rc0r 7561  1Rc1r 7562  1c1 8076
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-xp 4737  df-cnv 4739  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fv 5341  df-ov 6031  df-ec 6747  df-1nqqs 7614  df-i1p 7730  df-1r 7995  df-1 8083
This theorem is referenced by:  pitonn  8111
  Copyright terms: Public domain W3C validator