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

Theorem pitonnlem1 7912
Description: Lemma for pitonn 7915. 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 7887 . 2 1 = ⟨1R, 0R
2 df-1r 7799 . . . 4 1R = [⟨(1P +P 1P), 1P⟩] ~R
3 df-i1p 7534 . . . . . . . 8 1P = ⟨{𝑙𝑙 <Q 1Q}, {𝑢 ∣ 1Q <Q 𝑢}⟩
4 df-1nqqs 7418 . . . . . . . . . . 11 1Q = [⟨1o, 1o⟩] ~Q
54breq2i 4041 . . . . . . . . . 10 (𝑙 <Q 1Q𝑙 <Q [⟨1o, 1o⟩] ~Q )
65abbii 2312 . . . . . . . . 9 {𝑙𝑙 <Q 1Q} = {𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }
74breq1i 4040 . . . . . . . . . 10 (1Q <Q 𝑢 ↔ [⟨1o, 1o⟩] ~Q <Q 𝑢)
87abbii 2312 . . . . . . . . 9 {𝑢 ∣ 1Q <Q 𝑢} = {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}
96, 8opeq12i 3813 . . . . . . . 8 ⟨{𝑙𝑙 <Q 1Q}, {𝑢 ∣ 1Q <Q 𝑢}⟩ = ⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩
103, 9eqtri 2217 . . . . . . 7 1P = ⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩
1110oveq1i 5932 . . . . . 6 (1P +P 1P) = (⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P)
1211opeq1i 3811 . . . . 5 ⟨(1P +P 1P), 1P⟩ = ⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P
13 eceq1 6627 . . . . 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 2217 . . 3 1R = [⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R
1615opeq1i 3811 . 2 ⟨1R, 0R⟩ = ⟨[⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R
171, 16eqtr2i 2218 1 ⟨[⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ = 1
Colors of variables: wff set class
Syntax hints:   = wceq 1364  {cab 2182  cop 3625   class class class wbr 4033  (class class class)co 5922  1oc1o 6467  [cec 6590   ~Q ceq 7346  1Qc1q 7348   <Q cltq 7352  1Pc1p 7359   +P cpp 7360   ~R cer 7363  0Rc0r 7365  1Rc1r 7366  1c1 7880
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-xp 4669  df-cnv 4671  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fv 5266  df-ov 5925  df-ec 6594  df-1nqqs 7418  df-i1p 7534  df-1r 7799  df-1 7887
This theorem is referenced by:  pitonn  7915
  Copyright terms: Public domain W3C validator