Theorem addclprlem1 10995

Description: Lemma to prove downward closure in positive real addition. Part of proof of Proposition 9-3.5 of [Gleason] p. 123. (Contributed by NM, 13-Mar-1996.) (New usage is discouraged.)

Assertion

Ref	Expression
addclprlem1	⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ 𝑥 ∈ Q) → (𝑥 <Q (𝑔 +Q ℎ) → ((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) ∈ 𝐴))

Proof of Theorem addclprlem1

Dummy variables 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elprnq 10970	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) → 𝑔 ∈ Q)
2		ltrnq 10958	. . . . 5 ⊢ (𝑥 <Q (𝑔 +Q ℎ) ↔ (*Q‘(𝑔 +Q ℎ)) <Q (*Q‘𝑥))
3		ltmnq 10951	. . . . . 6 ⊢ (𝑥 ∈ Q → ((*Q‘(𝑔 +Q ℎ)) <Q (*Q‘𝑥) ↔ (𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) <Q (𝑥 ·Q (*Q‘𝑥))))
4		ovex 7427	. . . . . . 7 ⊢ (𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ∈ V
5		ovex 7427	. . . . . . 7 ⊢ (𝑥 ·Q (*Q‘𝑥)) ∈ V
6		ltmnq 10951	. . . . . . 7 ⊢ (𝑤 ∈ Q → (𝑦 <Q 𝑧 ↔ (𝑤 ·Q 𝑦) <Q (𝑤 ·Q 𝑧)))
7		vex 3478	. . . . . . 7 ⊢ 𝑔 ∈ V
8		mulcomnq 10932	. . . . . . 7 ⊢ (𝑦 ·Q 𝑧) = (𝑧 ·Q 𝑦)
9	4, 5, 6, 7, 8	caovord2 7603	. . . . . 6 ⊢ (𝑔 ∈ Q → ((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) <Q (𝑥 ·Q (*Q‘𝑥)) ↔ ((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) <Q ((𝑥 ·Q (*Q‘𝑥)) ·Q 𝑔)))
10	3, 9	sylan9bbr 511	. . . . 5 ⊢ ((𝑔 ∈ Q ∧ 𝑥 ∈ Q) → ((*Q‘(𝑔 +Q ℎ)) <Q (*Q‘𝑥) ↔ ((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) <Q ((𝑥 ·Q (*Q‘𝑥)) ·Q 𝑔)))
11	2, 10	bitrid 282	. . . 4 ⊢ ((𝑔 ∈ Q ∧ 𝑥 ∈ Q) → (𝑥 <Q (𝑔 +Q ℎ) ↔ ((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) <Q ((𝑥 ·Q (*Q‘𝑥)) ·Q 𝑔)))
12		recidnq 10944	. . . . . . 7 ⊢ (𝑥 ∈ Q → (𝑥 ·Q (*Q‘𝑥)) = 1Q)
13	12	oveq1d 7409	. . . . . 6 ⊢ (𝑥 ∈ Q → ((𝑥 ·Q (*Q‘𝑥)) ·Q 𝑔) = (1Q ·Q 𝑔))
14		mulcomnq 10932	. . . . . . 7 ⊢ (1Q ·Q 𝑔) = (𝑔 ·Q 1Q)
15		mulidnq 10942	. . . . . . 7 ⊢ (𝑔 ∈ Q → (𝑔 ·Q 1Q) = 𝑔)
16	14, 15	eqtrid 2784	. . . . . 6 ⊢ (𝑔 ∈ Q → (1Q ·Q 𝑔) = 𝑔)
17	13, 16	sylan9eqr 2794	. . . . 5 ⊢ ((𝑔 ∈ Q ∧ 𝑥 ∈ Q) → ((𝑥 ·Q (*Q‘𝑥)) ·Q 𝑔) = 𝑔)
18	17	breq2d 5154	. . . 4 ⊢ ((𝑔 ∈ Q ∧ 𝑥 ∈ Q) → (((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) <Q ((𝑥 ·Q (*Q‘𝑥)) ·Q 𝑔) ↔ ((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) <Q 𝑔))
19	11, 18	bitrd 278	. . 3 ⊢ ((𝑔 ∈ Q ∧ 𝑥 ∈ Q) → (𝑥 <Q (𝑔 +Q ℎ) ↔ ((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) <Q 𝑔))
20	1, 19	sylan 580	. 2 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ 𝑥 ∈ Q) → (𝑥 <Q (𝑔 +Q ℎ) ↔ ((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) <Q 𝑔))
21		prcdnq 10972	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) → (((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) <Q 𝑔 → ((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) ∈ 𝐴))
22	21	adantr 481	. 2 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ 𝑥 ∈ Q) → (((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) <Q 𝑔 → ((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) ∈ 𝐴))
23	20, 22	sylbid 239	1 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ 𝑥 ∈ Q) → (𝑥 <Q (𝑔 +Q ℎ) → ((𝑥 ·Q (*Q‘(𝑔 +Q ℎ))) ·Q 𝑔) ∈ 𝐴))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∈ wcel 2106   class class class wbr 5142  ‘cfv 6533  (class class class)co 7394  Qcnq 10831  1_Qc1q 10832   +_Q cplq 10834   ·_Q cmq 10835  *_Qcrq 10836   <_Q cltq 10837  Pcnp 10838

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5293  ax-nul 5300  ax-pr 5421  ax-un 7709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3775  df-csb 3891  df-dif 3948  df-un 3950  df-in 3952  df-ss 3962  df-pss 3964  df-nul 4320  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-iun 4993  df-br 5143  df-opab 5205  df-mpt 5226  df-tr 5260  df-id 5568  df-eprel 5574  df-po 5582  df-so 5583  df-fr 5625  df-we 5627  df-xp 5676  df-rel 5677  df-cnv 5678  df-co 5679  df-dm 5680  df-rn 5681  df-res 5682  df-ima 5683  df-pred 6290  df-ord 6357  df-on 6358  df-lim 6359  df-suc 6360  df-iota 6485  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7397  df-oprab 7398  df-mpo 7399  df-om 7840  df-1st 7959  df-2nd 7960  df-frecs 8250  df-wrecs 8281  df-recs 8355  df-rdg 8394  df-1o 8450  df-oadd 8454  df-omul 8455  df-er 8688  df-ni 10851  df-mi 10853  df-lti 10854  df-mpq 10888  df-ltpq 10889  df-enq 10890  df-nq 10891  df-erq 10892  df-mq 10894  df-1nq 10895  df-rq 10896  df-ltnq 10897  df-np 10960

This theorem is referenced by:  addclprlem2  10996