Theorem prsrriota 8008

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.

Step	Hyp	Ref	Expression
1		srpospr 8003	. . 3 ⊢ ((𝐴 ∈ R ∧ 0R <R 𝐴) → ∃!𝑦 ∈ P [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)
2		reurex 2752	. . 3 ⊢ (∃!𝑦 ∈ P [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴 → ∃𝑦 ∈ P [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)
3	1, 2	syl 14	. 2 ⊢ ((𝐴 ∈ R ∧ 0R <R 𝐴) → ∃𝑦 ∈ P [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)
4		simprr 533	. . . . 5 ⊢ (((𝐴 ∈ R ∧ 0R <R 𝐴) ∧ (𝑦 ∈ P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)
5		simprl 531	. . . . . 6 ⊢ (((𝐴 ∈ R ∧ 0R <R 𝐴) ∧ (𝑦 ∈ P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → 𝑦 ∈ P)
6		srpospr 8003	. . . . . . 7 ⊢ ((𝐴 ∈ R ∧ 0R <R 𝐴) → ∃!𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴)
7	6	adantr 276	. . . . . 6 ⊢ (((𝐴 ∈ R ∧ 0R <R 𝐴) ∧ (𝑦 ∈ P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → ∃!𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴)
8		oveq1 6025	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑥 +P 1P) = (𝑦 +P 1P))
9	8	opeq1d 3868	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ⟨(𝑥 +P 1P), 1P⟩ = ⟨(𝑦 +P 1P), 1P⟩)
10	9	eceq1d 6738	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → [⟨(𝑥 +P 1P), 1P⟩] ~R = [⟨(𝑦 +P 1P), 1P⟩] ~R )
11	10	eqeq1d 2240	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ([⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴 ↔ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴))
12	11	riota2 5995	. . . . . 6 ⊢ ((𝑦 ∈ P ∧ ∃!𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) → ([⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴 ↔ (℩𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) = 𝑦))
13	5, 7, 12	syl2anc 411	. . . . 5 ⊢ (((𝐴 ∈ R ∧ 0R <R 𝐴) ∧ (𝑦 ∈ P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → ([⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴 ↔ (℩𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) = 𝑦))
14	4, 13	mpbid 147	. . . 4 ⊢ (((𝐴 ∈ R ∧ 0R <R 𝐴) ∧ (𝑦 ∈ P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → (℩𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) = 𝑦)
15		oveq1 6025	. . . . . 6 ⊢ ((℩𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) = 𝑦 → ((℩𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P) = (𝑦 +P 1P))
16	15	opeq1d 3868	. . . . 5 ⊢ ((℩𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) = 𝑦 → ⟨((℩𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P), 1P⟩ = ⟨(𝑦 +P 1P), 1P⟩)
17	16	eceq1d 6738	. . . 4 ⊢ ((℩𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) = 𝑦 → [⟨((℩𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P), 1P⟩] ~R = [⟨(𝑦 +P 1P), 1P⟩] ~R )
18	14, 17	syl 14	. . 3 ⊢ (((𝐴 ∈ R ∧ 0R <R 𝐴) ∧ (𝑦 ∈ P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → [⟨((℩𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P), 1P⟩] ~R = [⟨(𝑦 +P 1P), 1P⟩] ~R )
19	18, 4	eqtrd 2264	. 2 ⊢ (((𝐴 ∈ R ∧ 0R <R 𝐴) ∧ (𝑦 ∈ P ∧ [⟨(𝑦 +P 1P), 1P⟩] ~R = 𝐴)) → [⟨((℩𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P), 1P⟩] ~R = 𝐴)
20	3, 19	rexlimddv 2655	1 ⊢ ((𝐴 ∈ R ∧ 0R <R 𝐴) → [⟨((℩𝑥 ∈ P [⟨(𝑥 +P 1P), 1P⟩] ~R = 𝐴) +P 1P), 1P⟩] ~R = 𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1397   ∈ wcel 2202  ∃wrex 2511  ∃!wreu 2512  ⟨cop 3672   class class class wbr 4088  ℩crio 5970  (class class class)co 6018  [cec 6700  Pcnp 7511  1_Pc1p 7512   +_P cpp 7513   ~_R cer 7516  Rcnr 7517  0_Rc0r 7518   <_R cltr 7523

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-eprel 4386  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-irdg 6536  df-1o 6582  df-2o 6583  df-oadd 6586  df-omul 6587  df-er 6702  df-ec 6704  df-qs 6708  df-ni 7524  df-pli 7525  df-mi 7526  df-lti 7527  df-plpq 7564  df-mpq 7565  df-enq 7567  df-nqqs 7568  df-plqqs 7569  df-mqqs 7570  df-1nqqs 7571  df-rq 7572  df-ltnqqs 7573  df-enq0 7644  df-nq0 7645  df-0nq0 7646  df-plq0 7647  df-mq0 7648  df-inp 7686  df-i1p 7687  df-iplp 7688  df-iltp 7690  df-enr 7946  df-nr 7947  df-ltr 7950  df-0r 7951

This theorem is referenced by:  caucvgsrlemfv  8011  caucvgsrlemgt1  8015