xmulgt0 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > xmulgt0		Structured version Visualization version GIF version

Theorem xmulgt0 13005

Description: Extended real version of mulgt0 11040. (Contributed by Mario Carneiro, 20-Aug-2015.)

**Assertion**
Ref	Expression
xmulgt0	⊢ (((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) → 0 < (𝐴 ·_e 𝐵))

**Proof of Theorem xmulgt0**
Step	Hyp	Ref	Expression
1		simpr 485	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) → 0 < 𝐴)
2		simpr 485	. . . . . 6 ⊢ ((𝐵 ∈ ℝ^* ∧ 0 < 𝐵) → 0 < 𝐵)
3	1, 2	anim12i 613	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) → (0 < 𝐴 ∧ 0 < 𝐵))
4		mulgt0 11040	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 < 𝐵)) → 0 < (𝐴 · 𝐵))
5	4	an4s 657	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (0 < 𝐴 ∧ 0 < 𝐵)) → 0 < (𝐴 · 𝐵))
6	5	ancoms 459	. . . . . 6 ⊢ (((0 < 𝐴 ∧ 0 < 𝐵) ∧ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → 0 < (𝐴 · 𝐵))
7		rexmul 12993	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ·_e 𝐵) = (𝐴 · 𝐵))
8	7	adantl 482	. . . . . 6 ⊢ (((0 < 𝐴 ∧ 0 < 𝐵) ∧ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → (𝐴 ·_e 𝐵) = (𝐴 · 𝐵))
9	6, 8	breqtrrd 5102	. . . . 5 ⊢ (((0 < 𝐴 ∧ 0 < 𝐵) ∧ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → 0 < (𝐴 ·_e 𝐵))
10	3, 9	sylan 580	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) ∧ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → 0 < (𝐴 ·_e 𝐵))
11	10	anassrs 468	. . 3 ⊢ (((((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) ∧ 𝐴 ∈ ℝ) ∧ 𝐵 ∈ ℝ) → 0 < (𝐴 ·_e 𝐵))
12		0ltpnf 12846	. . . . 5 ⊢ 0 < +∞
13		oveq2 7276	. . . . . 6 ⊢ (𝐵 = +∞ → (𝐴 ·_e 𝐵) = (𝐴 ·_e +∞))
14		xmulpnf1 12996	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) → (𝐴 ·_e +∞) = +∞)
15	14	adantr 481	. . . . . 6 ⊢ (((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) → (𝐴 ·_e +∞) = +∞)
16	13, 15	sylan9eqr 2800	. . . . 5 ⊢ ((((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) ∧ 𝐵 = +∞) → (𝐴 ·_e 𝐵) = +∞)
17	12, 16	breqtrrid 5112	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) ∧ 𝐵 = +∞) → 0 < (𝐴 ·_e 𝐵))
18	17	adantlr 712	. . 3 ⊢ (((((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) ∧ 𝐴 ∈ ℝ) ∧ 𝐵 = +∞) → 0 < (𝐴 ·_e 𝐵))
19		simplrr 775	. . . 4 ⊢ ((((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) ∧ 𝐴 ∈ ℝ) → 0 < 𝐵)
20		xmulasslem2 13004	. . . 4 ⊢ ((0 < 𝐵 ∧ 𝐵 = -∞) → 0 < (𝐴 ·_e 𝐵))
21	19, 20	sylan 580	. . 3 ⊢ (((((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) ∧ 𝐴 ∈ ℝ) ∧ 𝐵 = -∞) → 0 < (𝐴 ·_e 𝐵))
22		simprl 768	. . . . 5 ⊢ (((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) → 𝐵 ∈ ℝ^*)
23		elxr 12840	. . . . 5 ⊢ (𝐵 ∈ ℝ^* ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
24	22, 23	sylib 217	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) → (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
25	24	adantr 481	. . 3 ⊢ ((((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) ∧ 𝐴 ∈ ℝ) → (𝐵 ∈ ℝ ∨ 𝐵 = +∞ ∨ 𝐵 = -∞))
26	11, 18, 21, 25	mpjao3dan 1430	. 2 ⊢ ((((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) ∧ 𝐴 ∈ ℝ) → 0 < (𝐴 ·_e 𝐵))
27		oveq1 7275	. . . 4 ⊢ (𝐴 = +∞ → (𝐴 ·_e 𝐵) = (+∞ ·_e 𝐵))
28		xmulpnf2 12997	. . . . 5 ⊢ ((𝐵 ∈ ℝ^* ∧ 0 < 𝐵) → (+∞ ·_e 𝐵) = +∞)
29	28	adantl 482	. . . 4 ⊢ (((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) → (+∞ ·_e 𝐵) = +∞)
30	27, 29	sylan9eqr 2800	. . 3 ⊢ ((((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) ∧ 𝐴 = +∞) → (𝐴 ·_e 𝐵) = +∞)
31	12, 30	breqtrrid 5112	. 2 ⊢ ((((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) ∧ 𝐴 = +∞) → 0 < (𝐴 ·_e 𝐵))
32		xmulasslem2 13004	. . 3 ⊢ ((0 < 𝐴 ∧ 𝐴 = -∞) → 0 < (𝐴 ·_e 𝐵))
33	32	ad4ant24 751	. 2 ⊢ ((((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) ∧ 𝐴 = -∞) → 0 < (𝐴 ·_e 𝐵))
34		simpll 764	. . 3 ⊢ (((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) → 𝐴 ∈ ℝ^*)
35		elxr 12840	. . 3 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
36	34, 35	sylib 217	. 2 ⊢ (((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) → (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
37	26, 31, 33, 36	mpjao3dan 1430	1 ⊢ (((𝐴 ∈ ℝ^* ∧ 0 < 𝐴) ∧ (𝐵 ∈ ℝ^* ∧ 0 < 𝐵)) → 0 < (𝐴 ·_e 𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∨ w3o 1085 = wceq 1539 ∈ wcel 2106 class class class wbr 5074 (class class class)co 7268 ℝcr 10858 0cc0 10859 · cmul 10864 +∞cpnf 10994 -∞cmnf 10995 ℝ^*cxr 10996 < clt 10997 ·_e cxmu 12835

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-sep 5222 ax-nul 5229 ax-pow 5287 ax-pr 5351 ax-un 7579 ax-cnex 10915 ax-resscn 10916 ax-1cn 10917 ax-icn 10918 ax-addcl 10919 ax-addrcl 10920 ax-mulcl 10921 ax-mulrcl 10922 ax-mulcom 10923 ax-addass 10924 ax-mulass 10925 ax-distr 10926 ax-i2m1 10927 ax-1ne0 10928 ax-1rid 10929 ax-rnegex 10930 ax-rrecex 10931 ax-cnre 10932 ax-pre-lttri 10933 ax-pre-lttrn 10934 ax-pre-ltadd 10935 ax-pre-mulgt0 10936

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3432 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4258 df-if 4461 df-pw 4536 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4841 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5485 df-po 5499 df-so 5500 df-xp 5591 df-rel 5592 df-cnv 5593 df-co 5594 df-dm 5595 df-rn 5596 df-res 5597 df-ima 5598 df-iota 6385 df-fun 6429 df-fn 6430 df-f 6431 df-f1 6432 df-fo 6433 df-f1o 6434 df-fv 6435 df-ov 7271 df-oprab 7272 df-mpo 7273 df-er 8486 df-en 8722 df-dom 8723 df-sdom 8724 df-pnf 10999 df-mnf 11000 df-xr 11001 df-ltxr 11002 df-xmul 12838

This theorem is referenced by: xmulge0 13006 xmulasslem3 13008

W3C validator