| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > axpre-mulgt0 | GIF version | ||
| Description: The product of two positive reals is positive. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-pre-mulgt0 8192. (Contributed by NM, 13-May-1996.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| axpre-mulgt0 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵) → 0 <ℝ (𝐴 · 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elreal 8091 | . 2 ⊢ (𝐴 ∈ ℝ ↔ ∃𝑥 ∈ R 〈𝑥, 0R〉 = 𝐴) | |
| 2 | elreal 8091 | . 2 ⊢ (𝐵 ∈ ℝ ↔ ∃𝑦 ∈ R 〈𝑦, 0R〉 = 𝐵) | |
| 3 | breq2 4097 | . . . 4 ⊢ (〈𝑥, 0R〉 = 𝐴 → (0 <ℝ 〈𝑥, 0R〉 ↔ 0 <ℝ 𝐴)) | |
| 4 | 3 | anbi1d 465 | . . 3 ⊢ (〈𝑥, 0R〉 = 𝐴 → ((0 <ℝ 〈𝑥, 0R〉 ∧ 0 <ℝ 〈𝑦, 0R〉) ↔ (0 <ℝ 𝐴 ∧ 0 <ℝ 〈𝑦, 0R〉))) |
| 5 | oveq1 6035 | . . . 4 ⊢ (〈𝑥, 0R〉 = 𝐴 → (〈𝑥, 0R〉 · 〈𝑦, 0R〉) = (𝐴 · 〈𝑦, 0R〉)) | |
| 6 | 5 | breq2d 4105 | . . 3 ⊢ (〈𝑥, 0R〉 = 𝐴 → (0 <ℝ (〈𝑥, 0R〉 · 〈𝑦, 0R〉) ↔ 0 <ℝ (𝐴 · 〈𝑦, 0R〉))) |
| 7 | 4, 6 | imbi12d 234 | . 2 ⊢ (〈𝑥, 0R〉 = 𝐴 → (((0 <ℝ 〈𝑥, 0R〉 ∧ 0 <ℝ 〈𝑦, 0R〉) → 0 <ℝ (〈𝑥, 0R〉 · 〈𝑦, 0R〉)) ↔ ((0 <ℝ 𝐴 ∧ 0 <ℝ 〈𝑦, 0R〉) → 0 <ℝ (𝐴 · 〈𝑦, 0R〉)))) |
| 8 | breq2 4097 | . . . 4 ⊢ (〈𝑦, 0R〉 = 𝐵 → (0 <ℝ 〈𝑦, 0R〉 ↔ 0 <ℝ 𝐵)) | |
| 9 | 8 | anbi2d 464 | . . 3 ⊢ (〈𝑦, 0R〉 = 𝐵 → ((0 <ℝ 𝐴 ∧ 0 <ℝ 〈𝑦, 0R〉) ↔ (0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵))) |
| 10 | oveq2 6036 | . . . 4 ⊢ (〈𝑦, 0R〉 = 𝐵 → (𝐴 · 〈𝑦, 0R〉) = (𝐴 · 𝐵)) | |
| 11 | 10 | breq2d 4105 | . . 3 ⊢ (〈𝑦, 0R〉 = 𝐵 → (0 <ℝ (𝐴 · 〈𝑦, 0R〉) ↔ 0 <ℝ (𝐴 · 𝐵))) |
| 12 | 9, 11 | imbi12d 234 | . 2 ⊢ (〈𝑦, 0R〉 = 𝐵 → (((0 <ℝ 𝐴 ∧ 0 <ℝ 〈𝑦, 0R〉) → 0 <ℝ (𝐴 · 〈𝑦, 0R〉)) ↔ ((0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵) → 0 <ℝ (𝐴 · 𝐵)))) |
| 13 | df-0 8082 | . . . . . 6 ⊢ 0 = 〈0R, 0R〉 | |
| 14 | 13 | breq1i 4100 | . . . . 5 ⊢ (0 <ℝ 〈𝑥, 0R〉 ↔ 〈0R, 0R〉 <ℝ 〈𝑥, 0R〉) |
| 15 | ltresr 8102 | . . . . 5 ⊢ (〈0R, 0R〉 <ℝ 〈𝑥, 0R〉 ↔ 0R <R 𝑥) | |
| 16 | 14, 15 | bitri 184 | . . . 4 ⊢ (0 <ℝ 〈𝑥, 0R〉 ↔ 0R <R 𝑥) |
| 17 | 13 | breq1i 4100 | . . . . 5 ⊢ (0 <ℝ 〈𝑦, 0R〉 ↔ 〈0R, 0R〉 <ℝ 〈𝑦, 0R〉) |
| 18 | ltresr 8102 | . . . . 5 ⊢ (〈0R, 0R〉 <ℝ 〈𝑦, 0R〉 ↔ 0R <R 𝑦) | |
| 19 | 17, 18 | bitri 184 | . . . 4 ⊢ (0 <ℝ 〈𝑦, 0R〉 ↔ 0R <R 𝑦) |
| 20 | mulgt0sr 8041 | . . . 4 ⊢ ((0R <R 𝑥 ∧ 0R <R 𝑦) → 0R <R (𝑥 ·R 𝑦)) | |
| 21 | 16, 19, 20 | syl2anb 291 | . . 3 ⊢ ((0 <ℝ 〈𝑥, 0R〉 ∧ 0 <ℝ 〈𝑦, 0R〉) → 0R <R (𝑥 ·R 𝑦)) |
| 22 | 13 | a1i 9 | . . . . 5 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → 0 = 〈0R, 0R〉) |
| 23 | mulresr 8101 | . . . . 5 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (〈𝑥, 0R〉 · 〈𝑦, 0R〉) = 〈(𝑥 ·R 𝑦), 0R〉) | |
| 24 | 22, 23 | breq12d 4106 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (0 <ℝ (〈𝑥, 0R〉 · 〈𝑦, 0R〉) ↔ 〈0R, 0R〉 <ℝ 〈(𝑥 ·R 𝑦), 0R〉)) |
| 25 | ltresr 8102 | . . . 4 ⊢ (〈0R, 0R〉 <ℝ 〈(𝑥 ·R 𝑦), 0R〉 ↔ 0R <R (𝑥 ·R 𝑦)) | |
| 26 | 24, 25 | bitrdi 196 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (0 <ℝ (〈𝑥, 0R〉 · 〈𝑦, 0R〉) ↔ 0R <R (𝑥 ·R 𝑦))) |
| 27 | 21, 26 | imbitrrid 156 | . 2 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → ((0 <ℝ 〈𝑥, 0R〉 ∧ 0 <ℝ 〈𝑦, 0R〉) → 0 <ℝ (〈𝑥, 0R〉 · 〈𝑦, 0R〉))) |
| 28 | 1, 2, 7, 12, 27 | 2gencl 2837 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵) → 0 <ℝ (𝐴 · 𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2202 〈cop 3676 class class class wbr 4093 (class class class)co 6028 Rcnr 7560 0Rc0r 7561 ·R cmr 7565 <R cltr 7566 ℝcr 8074 0cc0 8075 <ℝ cltrr 8079 · cmul 8080 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-eprel 4392 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-irdg 6579 df-1o 6625 df-2o 6626 df-oadd 6629 df-omul 6630 df-er 6745 df-ec 6747 df-qs 6751 df-ni 7567 df-pli 7568 df-mi 7569 df-lti 7570 df-plpq 7607 df-mpq 7608 df-enq 7610 df-nqqs 7611 df-plqqs 7612 df-mqqs 7613 df-1nqqs 7614 df-rq 7615 df-ltnqqs 7616 df-enq0 7687 df-nq0 7688 df-0nq0 7689 df-plq0 7690 df-mq0 7691 df-inp 7729 df-i1p 7730 df-iplp 7731 df-imp 7732 df-iltp 7733 df-enr 7989 df-nr 7990 df-plr 7991 df-mr 7992 df-ltr 7993 df-0r 7994 df-m1r 7996 df-c 8081 df-0 8082 df-r 8085 df-mul 8087 df-lt 8088 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |