Theorem mulclprlem 11108

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

Assertion

Ref	Expression
mulclprlem	⊢ ((((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) ∧ 𝑥 ∈ Q) → (𝑥 <Q (𝑔 ·Q ℎ) → 𝑥 ∈ (𝐴 ·P 𝐵)))

Distinct variable groups:   𝑥,𝑔,ℎ   𝑥,𝐴   𝑥,𝐵

Allowed substitution hints:   𝐴(𝑔, ℎ)   𝐵(𝑔, ℎ)

Proof of Theorem mulclprlem

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

Step	Hyp	Ref	Expression
1		elprnq 11080	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) → 𝑔 ∈ Q)
2		elprnq 11080	. . . . . 6 ⊢ ((𝐵 ∈ P ∧ ℎ ∈ 𝐵) → ℎ ∈ Q)
3		recclnq 11055	. . . . . . . . 9 ⊢ (ℎ ∈ Q → (*Q‘ℎ) ∈ Q)
4	3	adantl 487	. . . . . . . 8 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (*Q‘ℎ) ∈ Q)
5		vex 3454	. . . . . . . . 9 ⊢ 𝑥 ∈ V
6		ovex 7454	. . . . . . . . 9 ⊢ (𝑔 ·Q ℎ) ∈ V
7		ltmnq 11061	. . . . . . . . 9 ⊢ (𝑤 ∈ Q → (𝑦 <Q 𝑧 ↔ (𝑤 ·Q 𝑦) <Q (𝑤 ·Q 𝑧)))
8		fvex 6899	. . . . . . . . 9 ⊢ (*Q‘ℎ) ∈ V
9		mulcomnq 11042	. . . . . . . . 9 ⊢ (𝑦 ·Q 𝑧) = (𝑧 ·Q 𝑦)
10	5, 6, 7, 8, 9	caovord2 7634	. . . . . . . 8 ⊢ ((*Q‘ℎ) ∈ Q → (𝑥 <Q (𝑔 ·Q ℎ) ↔ (𝑥 ·Q (*Q‘ℎ)) <Q ((𝑔 ·Q ℎ) ·Q (*Q‘ℎ))))
11	4, 10	syl 18	. . . . . . 7 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑥 <Q (𝑔 ·Q ℎ) ↔ (𝑥 ·Q (*Q‘ℎ)) <Q ((𝑔 ·Q ℎ) ·Q (*Q‘ℎ))))
12		mulassnq 11048	. . . . . . . . . 10 ⊢ ((𝑔 ·Q ℎ) ·Q (*Q‘ℎ)) = (𝑔 ·Q (ℎ ·Q (*Q‘ℎ)))
13		recidnq 11054	. . . . . . . . . . 11 ⊢ (ℎ ∈ Q → (ℎ ·Q (*Q‘ℎ)) = 1Q)
14	13	oveq2d 7437	. . . . . . . . . 10 ⊢ (ℎ ∈ Q → (𝑔 ·Q (ℎ ·Q (*Q‘ℎ))) = (𝑔 ·Q 1Q))
15	12, 14	eqtrid 2807	. . . . . . . . 9 ⊢ (ℎ ∈ Q → ((𝑔 ·Q ℎ) ·Q (*Q‘ℎ)) = (𝑔 ·Q 1Q))
16		mulidnq 11052	. . . . . . . . 9 ⊢ (𝑔 ∈ Q → (𝑔 ·Q 1Q) = 𝑔)
17	15, 16	sylan9eqr 2817	. . . . . . . 8 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → ((𝑔 ·Q ℎ) ·Q (*Q‘ℎ)) = 𝑔)
18	17	breq2d 5114	. . . . . . 7 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → ((𝑥 ·Q (*Q‘ℎ)) <Q ((𝑔 ·Q ℎ) ·Q (*Q‘ℎ)) ↔ (𝑥 ·Q (*Q‘ℎ)) <Q 𝑔))
19	11, 18	bitrd 282	. . . . . 6 ⊢ ((𝑔 ∈ Q ∧ ℎ ∈ Q) → (𝑥 <Q (𝑔 ·Q ℎ) ↔ (𝑥 ·Q (*Q‘ℎ)) <Q 𝑔))
20	1, 2, 19	syl2an 608	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → (𝑥 <Q (𝑔 ·Q ℎ) ↔ (𝑥 ·Q (*Q‘ℎ)) <Q 𝑔))
21		prcdnq 11082	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) → ((𝑥 ·Q (*Q‘ℎ)) <Q 𝑔 → (𝑥 ·Q (*Q‘ℎ)) ∈ 𝐴))
22	21	adantr 486	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → ((𝑥 ·Q (*Q‘ℎ)) <Q 𝑔 → (𝑥 ·Q (*Q‘ℎ)) ∈ 𝐴))
23	20, 22	sylbid 243	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → (𝑥 <Q (𝑔 ·Q ℎ) → (𝑥 ·Q (*Q‘ℎ)) ∈ 𝐴))
24		df-mp 11073	. . . . . . . . 9 ⊢ ·P = (𝑤 ∈ P, 𝑣 ∈ P ↦ {𝑥 ∣ ∃𝑦 ∈ 𝑤 ∃𝑧 ∈ 𝑣 𝑥 = (𝑦 ·Q 𝑧)})
25		mulclnq 11036	. . . . . . . . 9 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦 ·Q 𝑧) ∈ Q)
26	24, 25	genpprecl 11090	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((𝑥 ·Q (*Q‘ℎ)) ∈ 𝐴 ∧ ℎ ∈ 𝐵) → ((𝑥 ·Q (*Q‘ℎ)) ·Q ℎ) ∈ (𝐴 ·P 𝐵)))
27	26	exp4b 436	. . . . . . 7 ⊢ (𝐴 ∈ P → (𝐵 ∈ P → ((𝑥 ·Q (*Q‘ℎ)) ∈ 𝐴 → (ℎ ∈ 𝐵 → ((𝑥 ·Q (*Q‘ℎ)) ·Q ℎ) ∈ (𝐴 ·P 𝐵)))))
28	27	com34 92	. . . . . 6 ⊢ (𝐴 ∈ P → (𝐵 ∈ P → (ℎ ∈ 𝐵 → ((𝑥 ·Q (*Q‘ℎ)) ∈ 𝐴 → ((𝑥 ·Q (*Q‘ℎ)) ·Q ℎ) ∈ (𝐴 ·P 𝐵)))))
29	28	imp32 424	. . . . 5 ⊢ ((𝐴 ∈ P ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → ((𝑥 ·Q (*Q‘ℎ)) ∈ 𝐴 → ((𝑥 ·Q (*Q‘ℎ)) ·Q ℎ) ∈ (𝐴 ·P 𝐵)))
30	29	adantlr 728	. . . 4 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → ((𝑥 ·Q (*Q‘ℎ)) ∈ 𝐴 → ((𝑥 ·Q (*Q‘ℎ)) ·Q ℎ) ∈ (𝐴 ·P 𝐵)))
31	23, 30	syld 48	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → (𝑥 <Q (𝑔 ·Q ℎ) → ((𝑥 ·Q (*Q‘ℎ)) ·Q ℎ) ∈ (𝐴 ·P 𝐵)))
32	31	adantr 486	. 2 ⊢ ((((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) ∧ 𝑥 ∈ Q) → (𝑥 <Q (𝑔 ·Q ℎ) → ((𝑥 ·Q (*Q‘ℎ)) ·Q ℎ) ∈ (𝐴 ·P 𝐵)))
33	2	adantl 487	. . 3 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → ℎ ∈ Q)
34		mulassnq 11048	. . . . . 6 ⊢ ((𝑥 ·Q (*Q‘ℎ)) ·Q ℎ) = (𝑥 ·Q ((*Q‘ℎ) ·Q ℎ))
35		mulcomnq 11042	. . . . . . . 8 ⊢ ((*Q‘ℎ) ·Q ℎ) = (ℎ ·Q (*Q‘ℎ))
36	35, 13	eqtrid 2807	. . . . . . 7 ⊢ (ℎ ∈ Q → ((*Q‘ℎ) ·Q ℎ) = 1Q)
37	36	oveq2d 7437	. . . . . 6 ⊢ (ℎ ∈ Q → (𝑥 ·Q ((*Q‘ℎ) ·Q ℎ)) = (𝑥 ·Q 1Q))
38	34, 37	eqtrid 2807	. . . . 5 ⊢ (ℎ ∈ Q → ((𝑥 ·Q (*Q‘ℎ)) ·Q ℎ) = (𝑥 ·Q 1Q))
39		mulidnq 11052	. . . . 5 ⊢ (𝑥 ∈ Q → (𝑥 ·Q 1Q) = 𝑥)
40	38, 39	sylan9eq 2815	. . . 4 ⊢ ((ℎ ∈ Q ∧ 𝑥 ∈ Q) → ((𝑥 ·Q (*Q‘ℎ)) ·Q ℎ) = 𝑥)
41	40	eleq1d 2845	. . 3 ⊢ ((ℎ ∈ Q ∧ 𝑥 ∈ Q) → (((𝑥 ·Q (*Q‘ℎ)) ·Q ℎ) ∈ (𝐴 ·P 𝐵) ↔ 𝑥 ∈ (𝐴 ·P 𝐵)))
42	33, 41	sylan 592	. 2 ⊢ ((((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) ∧ 𝑥 ∈ Q) → (((𝑥 ·Q (*Q‘ℎ)) ·Q ℎ) ∈ (𝐴 ·P 𝐵) ↔ 𝑥 ∈ (𝐴 ·P 𝐵)))
43	32, 42	sylibd 242	1 ⊢ ((((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) ∧ 𝑥 ∈ Q) → (𝑥 <Q (𝑔 ·Q ℎ) → 𝑥 ∈ (𝐴 ·P 𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2144   class class class wbr 5102  ‘cfv 6539  (class class class)co 7421  Qcnq 10941  1_Qc1q 10942   ·_Q cmq 10945  *_Qcrq 10946   <_Q cltq 10947  Pcnp 10948   ·_P cmp 10951

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752  ax-inf2 9646

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-om 7879  df-1st 8002  df-2nd 8003  df-frecs 8303  df-wrecs 8334  df-recs 8383  df-rdg 8422  df-1o 8480  df-oadd 8484  df-omul 8485  df-er 8721  df-ni 10961  df-mi 10963  df-lti 10964  df-mpq 10998  df-ltpq 10999  df-enq 11000  df-nq 11001  df-erq 11002  df-mq 11004  df-1nq 11005  df-rq 11006  df-ltnq 11007  df-np 11070  df-mp 11073

This theorem is used by:  mulclpr  11109