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

Theorem pitonnlem1 7978
Description: Lemma for pitonn 7981. 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 7953 . 2 1 = ⟨1R, 0R
2 df-1r 7865 . . . 4 1R = [⟨(1P +P 1P), 1P⟩] ~R
3 df-i1p 7600 . . . . . . . 8 1P = ⟨{𝑙𝑙 <Q 1Q}, {𝑢 ∣ 1Q <Q 𝑢}⟩
4 df-1nqqs 7484 . . . . . . . . . . 11 1Q = [⟨1o, 1o⟩] ~Q
54breq2i 4059 . . . . . . . . . 10 (𝑙 <Q 1Q𝑙 <Q [⟨1o, 1o⟩] ~Q )
65abbii 2322 . . . . . . . . 9 {𝑙𝑙 <Q 1Q} = {𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }
74breq1i 4058 . . . . . . . . . 10 (1Q <Q 𝑢 ↔ [⟨1o, 1o⟩] ~Q <Q 𝑢)
87abbii 2322 . . . . . . . . 9 {𝑢 ∣ 1Q <Q 𝑢} = {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}
96, 8opeq12i 3830 . . . . . . . 8 ⟨{𝑙𝑙 <Q 1Q}, {𝑢 ∣ 1Q <Q 𝑢}⟩ = ⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩
103, 9eqtri 2227 . . . . . . 7 1P = ⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩
1110oveq1i 5967 . . . . . 6 (1P +P 1P) = (⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P)
1211opeq1i 3828 . . . . 5 ⟨(1P +P 1P), 1P⟩ = ⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P
13 eceq1 6668 . . . . 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 2227 . . 3 1R = [⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R
1615opeq1i 3828 . 2 ⟨1R, 0R⟩ = ⟨[⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R
171, 16eqtr2i 2228 1 ⟨[⟨(⟨{𝑙𝑙 <Q [⟨1o, 1o⟩] ~Q }, {𝑢 ∣ [⟨1o, 1o⟩] ~Q <Q 𝑢}⟩ +P 1P), 1P⟩] ~R , 0R⟩ = 1
Colors of variables: wff set class
Syntax hints:   = wceq 1373  {cab 2192  cop 3641   class class class wbr 4051  (class class class)co 5957  1oc1o 6508  [cec 6631   ~Q ceq 7412  1Qc1q 7414   <Q cltq 7418  1Pc1p 7425   +P cpp 7426   ~R cer 7429  0Rc0r 7431  1Rc1r 7432  1c1 7946
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-rex 2491  df-v 2775  df-un 3174  df-in 3176  df-ss 3183  df-sn 3644  df-pr 3645  df-op 3647  df-uni 3857  df-br 4052  df-opab 4114  df-xp 4689  df-cnv 4691  df-dm 4693  df-rn 4694  df-res 4695  df-ima 4696  df-iota 5241  df-fv 5288  df-ov 5960  df-ec 6635  df-1nqqs 7484  df-i1p 7600  df-1r 7865  df-1 7953
This theorem is referenced by:  pitonn  7981
  Copyright terms: Public domain W3C validator