Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > axpre-mulgt0 | Structured version Visualization version GIF version |
Description: The product of two positive reals is positive. Axiom 21 of 22 for real and complex numbers, derived from ZF set theory. Note: The more general version for extended reals is axmulgt0 10980. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-mulgt0 10879. (Contributed by NM, 13-May-1996.) (New usage is discouraged.) |
Ref | Expression |
---|---|
axpre-mulgt0 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵) → 0 <ℝ (𝐴 · 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elreal 10818 | . 2 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) | |
2 | elreal 10818 | . 2 ⊢ (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R 〈𝑦, 0R〉 = 𝐵) | |
3 | breq2 5074 | . . . 4 ⊢ (〈𝑥, 0R〉 = 𝐴 → (0 <ℝ 〈𝑥, 0R〉 ↔ 0 <ℝ 𝐴)) | |
4 | 3 | anbi1d 629 | . . 3 ⊢ (〈𝑥, 0R〉 = 𝐴 → ((0 <ℝ 〈𝑥, 0R〉 ∧ 0 <ℝ 〈𝑦, 0R〉) ↔ (0 <ℝ 𝐴 ∧ 0 <ℝ 〈𝑦, 0R〉))) |
5 | oveq1 7262 | . . . 4 ⊢ (〈𝑥, 0R〉 = 𝐴 → (〈𝑥, 0R〉 · 〈𝑦, 0R〉) = (𝐴 · 〈𝑦, 0R〉)) | |
6 | 5 | breq2d 5082 | . . 3 ⊢ (〈𝑥, 0R〉 = 𝐴 → (0 <ℝ (〈𝑥, 0R〉 · 〈𝑦, 0R〉) ↔ 0 <ℝ (𝐴 · 〈𝑦, 0R〉))) |
7 | 4, 6 | imbi12d 344 | . 2 ⊢ (〈𝑥, 0R〉 = 𝐴 → (((0 <ℝ 〈𝑥, 0R〉 ∧ 0 <ℝ 〈𝑦, 0R〉) → 0 <ℝ (〈𝑥, 0R〉 · 〈𝑦, 0R〉)) ↔ ((0 <ℝ 𝐴 ∧ 0 <ℝ 〈𝑦, 0R〉) → 0 <ℝ (𝐴 · 〈𝑦, 0R〉)))) |
8 | breq2 5074 | . . . 4 ⊢ (〈𝑦, 0R〉 = 𝐵 → (0 <ℝ 〈𝑦, 0R〉 ↔ 0 <ℝ 𝐵)) | |
9 | 8 | anbi2d 628 | . . 3 ⊢ (〈𝑦, 0R〉 = 𝐵 → ((0 <ℝ 𝐴 ∧ 0 <ℝ 〈𝑦, 0R〉) ↔ (0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵))) |
10 | oveq2 7263 | . . . 4 ⊢ (〈𝑦, 0R〉 = 𝐵 → (𝐴 · 〈𝑦, 0R〉) = (𝐴 · 𝐵)) | |
11 | 10 | breq2d 5082 | . . 3 ⊢ (〈𝑦, 0R〉 = 𝐵 → (0 <ℝ (𝐴 · 〈𝑦, 0R〉) ↔ 0 <ℝ (𝐴 · 𝐵))) |
12 | 9, 11 | imbi12d 344 | . 2 ⊢ (〈𝑦, 0R〉 = 𝐵 → (((0 <ℝ 𝐴 ∧ 0 <ℝ 〈𝑦, 0R〉) → 0 <ℝ (𝐴 · 〈𝑦, 0R〉)) ↔ ((0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵) → 0 <ℝ (𝐴 · 𝐵)))) |
13 | df-0 10809 | . . . . . 6 ⊢ 0 = 〈0R, 0R〉 | |
14 | 13 | breq1i 5077 | . . . . 5 ⊢ (0 <ℝ 〈𝑥, 0R〉 ↔ 〈0R, 0R〉 <ℝ 〈𝑥, 0R〉) |
15 | ltresr 10827 | . . . . 5 ⊢ (〈0R, 0R〉 <ℝ 〈𝑥, 0R〉 ↔ 0R <R 𝑥) | |
16 | 14, 15 | bitri 274 | . . . 4 ⊢ (0 <ℝ 〈𝑥, 0R〉 ↔ 0R <R 𝑥) |
17 | 13 | breq1i 5077 | . . . . 5 ⊢ (0 <ℝ 〈𝑦, 0R〉 ↔ 〈0R, 0R〉 <ℝ 〈𝑦, 0R〉) |
18 | ltresr 10827 | . . . . 5 ⊢ (〈0R, 0R〉 <ℝ 〈𝑦, 0R〉 ↔ 0R <R 𝑦) | |
19 | 17, 18 | bitri 274 | . . . 4 ⊢ (0 <ℝ 〈𝑦, 0R〉 ↔ 0R <R 𝑦) |
20 | mulgt0sr 10792 | . . . 4 ⊢ ((0R <R 𝑥 ∧ 0R <R 𝑦) → 0R <R (𝑥 ·R 𝑦)) | |
21 | 16, 19, 20 | syl2anb 597 | . . 3 ⊢ ((0 <ℝ 〈𝑥, 0R〉 ∧ 0 <ℝ 〈𝑦, 0R〉) → 0R <R (𝑥 ·R 𝑦)) |
22 | 13 | a1i 11 | . . . . 5 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → 0 = 〈0R, 0R〉) |
23 | mulresr 10826 | . . . . 5 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (〈𝑥, 0R〉 · 〈𝑦, 0R〉) = 〈(𝑥 ·R 𝑦), 0R〉) | |
24 | 22, 23 | breq12d 5083 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (0 <ℝ (〈𝑥, 0R〉 · 〈𝑦, 0R〉) ↔ 〈0R, 0R〉 <ℝ 〈(𝑥 ·R 𝑦), 0R〉)) |
25 | ltresr 10827 | . . . 4 ⊢ (〈0R, 0R〉 <ℝ 〈(𝑥 ·R 𝑦), 0R〉 ↔ 0R <R (𝑥 ·R 𝑦)) | |
26 | 24, 25 | bitrdi 286 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (0 <ℝ (〈𝑥, 0R〉 · 〈𝑦, 0R〉) ↔ 0R <R (𝑥 ·R 𝑦))) |
27 | 21, 26 | syl5ibr 245 | . 2 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → ((0 <ℝ 〈𝑥, 0R〉 ∧ 0 <ℝ 〈𝑦, 0R〉) → 0 <ℝ (〈𝑥, 0R〉 · 〈𝑦, 0R〉))) |
28 | 1, 2, 7, 12, 27 | 2gencl 3462 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵) → 0 <ℝ (𝐴 · 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 〈cop 4564 class class class wbr 5070 (class class class)co 7255 Rcnr 10552 0Rc0r 10553 ·R cmr 10557 <R cltr 10558 ℝcr 10801 0cc0 10802 <ℝ cltrr 10806 · cmul 10807 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-oadd 8271 df-omul 8272 df-er 8456 df-ec 8458 df-qs 8462 df-ni 10559 df-pli 10560 df-mi 10561 df-lti 10562 df-plpq 10595 df-mpq 10596 df-ltpq 10597 df-enq 10598 df-nq 10599 df-erq 10600 df-plq 10601 df-mq 10602 df-1nq 10603 df-rq 10604 df-ltnq 10605 df-np 10668 df-1p 10669 df-plp 10670 df-mp 10671 df-ltp 10672 df-enr 10742 df-nr 10743 df-plr 10744 df-mr 10745 df-ltr 10746 df-0r 10747 df-m1r 10749 df-c 10808 df-0 10809 df-r 10812 df-mul 10814 df-lt 10815 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |