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

Theorem prsrriota 7783
Description: Mapping a restricted iota from a positive real to a signed real. (Contributed by Jim Kingdon, 29-Jun-2021.)
Assertion
Ref Expression
prsrriota ((𝐴R ∧ 0R <R 𝐴) → [⟨((𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P), 1P⟩] ~R = 𝐴)
Distinct variable group:   𝑥,𝐴

Proof of Theorem prsrriota
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 srpospr 7778 . . 3 ((𝐴R ∧ 0R <R 𝐴) → ∃!𝑦P [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)
2 reurex 2690 . . 3 (∃!𝑦P [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴 → ∃𝑦P [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)
31, 2syl 14 . 2 ((𝐴R ∧ 0R <R 𝐴) → ∃𝑦P [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)
4 simprr 531 . . . . 5 (((𝐴R ∧ 0R <R 𝐴) ∧ (𝑦P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)
5 simprl 529 . . . . . 6 (((𝐴R ∧ 0R <R 𝐴) ∧ (𝑦P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → 𝑦P)
6 srpospr 7778 . . . . . . 7 ((𝐴R ∧ 0R <R 𝐴) → ∃!𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴)
76adantr 276 . . . . . 6 (((𝐴R ∧ 0R <R 𝐴) ∧ (𝑦P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → ∃!𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴)
8 oveq1 5878 . . . . . . . . . 10 (𝑥 = 𝑦 → (𝑥 +P 1P) = (𝑦 +P 1P))
98opeq1d 3784 . . . . . . . . 9 (𝑥 = 𝑦 → ⟨(𝑥 +P 1P), 1P⟩ = ⟨(𝑦 +P 1P), 1P⟩)
109eceq1d 6567 . . . . . . . 8 (𝑥 = 𝑦 → [⟨(𝑥 +P 1P), 1P⟩] ~R = [⟨(𝑦 +P 1P), 1P⟩] ~R )
1110eqeq1d 2186 . . . . . . 7 (𝑥 = 𝑦 → ([⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴 ↔ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴))
1211riota2 5849 . . . . . 6 ((𝑦P ∧ ∃!𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) → ([⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴 ↔ (𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) = 𝑦))
135, 7, 12syl2anc 411 . . . . 5 (((𝐴R ∧ 0R <R 𝐴) ∧ (𝑦P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → ([⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴 ↔ (𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) = 𝑦))
144, 13mpbid 147 . . . 4 (((𝐴R ∧ 0R <R 𝐴) ∧ (𝑦P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → (𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) = 𝑦)
15 oveq1 5878 . . . . . 6 ((𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) = 𝑦 → ((𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P) = (𝑦 +P 1P))
1615opeq1d 3784 . . . . 5 ((𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) = 𝑦 → ⟨((𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P), 1P⟩ = ⟨(𝑦 +P 1P), 1P⟩)
1716eceq1d 6567 . . . 4 ((𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) = 𝑦 → [⟨((𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P), 1P⟩] ~R = [⟨(𝑦 +P 1P), 1P⟩] ~R )
1814, 17syl 14 . . 3 (((𝐴R ∧ 0R <R 𝐴) ∧ (𝑦P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → [⟨((𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P), 1P⟩] ~R = [⟨(𝑦 +P 1P), 1P⟩] ~R )
1918, 4eqtrd 2210 . 2 (((𝐴R ∧ 0R <R 𝐴) ∧ (𝑦P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → [⟨((𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P), 1P⟩] ~R = 𝐴)
203, 19rexlimddv 2599 1 ((𝐴R ∧ 0R <R 𝐴) → [⟨((𝑥P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P), 1P⟩] ~R = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1353  wcel 2148  wrex 2456  ∃!wreu 2457  cop 3595   class class class wbr 4002  crio 5826  (class class class)co 5871  [cec 6529  Pcnp 7286  1Pc1p 7287   +P cpp 7288   ~R cer 7291  Rcnr 7292  0Rc0r 7293   <R cltr 7298
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-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4117  ax-sep 4120  ax-nul 4128  ax-pow 4173  ax-pr 4208  ax-un 4432  ax-setind 4535  ax-iinf 4586
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-br 4003  df-opab 4064  df-mpt 4065  df-tr 4101  df-eprel 4288  df-id 4292  df-po 4295  df-iso 4296  df-iord 4365  df-on 4367  df-suc 4370  df-iom 4589  df-xp 4631  df-rel 4632  df-cnv 4633  df-co 4634  df-dm 4635  df-rn 4636  df-res 4637  df-ima 4638  df-iota 5176  df-fun 5216  df-fn 5217  df-f 5218  df-f1 5219  df-fo 5220  df-f1o 5221  df-fv 5222  df-riota 5827  df-ov 5874  df-oprab 5875  df-mpo 5876  df-1st 6137  df-2nd 6138  df-recs 6302  df-irdg 6367  df-1o 6413  df-2o 6414  df-oadd 6417  df-omul 6418  df-er 6531  df-ec 6533  df-qs 6537  df-ni 7299  df-pli 7300  df-mi 7301  df-lti 7302  df-plpq 7339  df-mpq 7340  df-enq 7342  df-nqqs 7343  df-plqqs 7344  df-mqqs 7345  df-1nqqs 7346  df-rq 7347  df-ltnqqs 7348  df-enq0 7419  df-nq0 7420  df-0nq0 7421  df-plq0 7422  df-mq0 7423  df-inp 7461  df-i1p 7462  df-iplp 7463  df-iltp 7465  df-enr 7721  df-nr 7722  df-ltr 7725  df-0r 7726
This theorem is referenced by:  caucvgsrlemfv  7786  caucvgsrlemgt1  7790
  Copyright terms: Public domain W3C validator