Theorem recidpipr 8224

Description: Another way of saying that a number times its reciprocal is one. (Contributed by Jim Kingdon, 17-Jul-2021.)

Assertion

Ref	Expression
recidpipr	⊢ (𝑁 ∈ N → (⟨{𝑙 ∣ 𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ ·P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑁, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑁, 1o⟩] ~Q ) <Q 𝑢}⟩) = 1P)

Distinct variable group:   𝑁,𝑙,𝑢

Proof of Theorem recidpipr

Step	Hyp	Ref	Expression
1		nnnq 7790	. . 3 ⊢ (𝑁 ∈ N → [⟨𝑁, 1o⟩] ~Q ∈ Q)
2		recclnq 7760	. . . 4 ⊢ ([⟨𝑁, 1o⟩] ~Q ∈ Q → (*Q‘[⟨𝑁, 1o⟩] ~Q ) ∈ Q)
3	1, 2	syl 14	. . 3 ⊢ (𝑁 ∈ N → (*Q‘[⟨𝑁, 1o⟩] ~Q ) ∈ Q)
4		mulnqpr 7945	. . 3 ⊢ (([⟨𝑁, 1o⟩] ~Q ∈ Q ∧ (*Q‘[⟨𝑁, 1o⟩] ~Q ) ∈ Q) → ⟨{𝑙 ∣ 𝑙 <Q ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q ))}, {𝑢 ∣ ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q )) <Q 𝑢}⟩ = (⟨{𝑙 ∣ 𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ ·P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑁, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑁, 1o⟩] ~Q ) <Q 𝑢}⟩))
5	1, 3, 4	syl2anc 415	. 2 ⊢ (𝑁 ∈ N → ⟨{𝑙 ∣ 𝑙 <Q ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q ))}, {𝑢 ∣ ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q )) <Q 𝑢}⟩ = (⟨{𝑙 ∣ 𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ ·P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑁, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑁, 1o⟩] ~Q ) <Q 𝑢}⟩))
6		recidnq 7761	. . . . . . 7 ⊢ ([⟨𝑁, 1o⟩] ~Q ∈ Q → ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q )) = 1Q)
7	1, 6	syl 14	. . . . . 6 ⊢ (𝑁 ∈ N → ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q )) = 1Q)
8	7	breq2d 4142	. . . . 5 ⊢ (𝑁 ∈ N → (𝑙 <Q ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q )) ↔ 𝑙 <Q 1Q))
9	8	abbidv 2358	. . . 4 ⊢ (𝑁 ∈ N → {𝑙 ∣ 𝑙 <Q ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q ))} = {𝑙 ∣ 𝑙 <Q 1Q})
10	7	breq1d 4140	. . . . 5 ⊢ (𝑁 ∈ N → (([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q )) <Q 𝑢 ↔ 1Q <Q 𝑢))
11	10	abbidv 2358	. . . 4 ⊢ (𝑁 ∈ N → {𝑢 ∣ ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q )) <Q 𝑢} = {𝑢 ∣ 1Q <Q 𝑢})
12	9, 11	opeq12d 3912	. . 3 ⊢ (𝑁 ∈ N → ⟨{𝑙 ∣ 𝑙 <Q ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q ))}, {𝑢 ∣ ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q )) <Q 𝑢}⟩ = ⟨{𝑙 ∣ 𝑙 <Q 1Q}, {𝑢 ∣ 1Q <Q 𝑢}⟩)
13		df-i1p 7835	. . 3 ⊢ 1P = ⟨{𝑙 ∣ 𝑙 <Q 1Q}, {𝑢 ∣ 1Q <Q 𝑢}⟩
14	12, 13	eqtr4di 2289	. 2 ⊢ (𝑁 ∈ N → ⟨{𝑙 ∣ 𝑙 <Q ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q ))}, {𝑢 ∣ ([⟨𝑁, 1o⟩] ~Q ·Q (*Q‘[⟨𝑁, 1o⟩] ~Q )) <Q 𝑢}⟩ = 1P)
15	5, 14	eqtr3d 2273	1 ⊢ (𝑁 ∈ N → (⟨{𝑙 ∣ 𝑙 <Q [⟨𝑁, 1o⟩] ~Q }, {𝑢 ∣ [⟨𝑁, 1o⟩] ~Q <Q 𝑢}⟩ ·P ⟨{𝑙 ∣ 𝑙 <Q (*Q‘[⟨𝑁, 1o⟩] ~Q )}, {𝑢 ∣ (*Q‘[⟨𝑁, 1o⟩] ~Q ) <Q 𝑢}⟩) = 1P)

This proof depends on syntax axioms:   → wi 4   = wceq 1402   ∈ wcel 2209  {cab 2224  ⟨cop 3712   class class class wbr 4130  ‘cfv 5377  (class class class)co 6085  1_oc1o 6680  [cec 6805  Ncnpi 7640   ~_Q ceq 7647  Qcnq 7648  1_Qc1q 7649   ·_Q cmq 7651  *_Qcrq 7652   <_Q cltq 7653  1_Pc1p 7660   ·_P cmp 7662

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-2o 6688  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7672  df-pli 7673  df-mi 7674  df-lti 7675  df-plpq 7712  df-mpq 7713  df-enq 7715  df-nqqs 7716  df-plqqs 7717  df-mqqs 7718  df-1nqqs 7719  df-rq 7720  df-ltnqqs 7721  df-enq0 7792  df-nq0 7793  df-0nq0 7794  df-plq0 7795  df-mq0 7796  df-inp 7834  df-i1p 7835  df-imp 7837

This theorem is used by:  recidpirq  8226