| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > gt0srpr | GIF version | ||
| Description: Greater than zero in terms of positive reals. (Contributed by NM, 13-May-1996.) |
| Ref | Expression |
|---|---|
| gt0srpr | ⊢ (0R <R [〈𝐴, 𝐵〉] ~R ↔ 𝐵<P 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | enrer 8050 | . . . . 5 ⊢ ~R Er (P × P) | |
| 2 | erdm 6777 | . . . . 5 ⊢ ( ~R Er (P × P) → dom ~R = (P × P)) | |
| 3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ dom ~R = (P × P) |
| 4 | ltrelsr 8053 | . . . . . . 7 ⊢ <R ⊆ (R × R) | |
| 5 | 4 | brel 4802 | . . . . . 6 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R → (0R ∈ R ∧ [〈𝐴, 𝐵〉] ~R ∈ R)) |
| 6 | 5 | simprd 114 | . . . . 5 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R → [〈𝐴, 𝐵〉] ~R ∈ R) |
| 7 | df-nr 8042 | . . . . 5 ⊢ R = ((P × P) / ~R ) | |
| 8 | 6, 7 | eleqtrdi 2325 | . . . 4 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R → [〈𝐴, 𝐵〉] ~R ∈ ((P × P) / ~R )) |
| 9 | ecelqsdm 6839 | . . . 4 ⊢ ((dom ~R = (P × P) ∧ [〈𝐴, 𝐵〉] ~R ∈ ((P × P) / ~R )) → 〈𝐴, 𝐵〉 ∈ (P × P)) | |
| 10 | 3, 8, 9 | sylancr 414 | . . 3 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R → 〈𝐴, 𝐵〉 ∈ (P × P)) |
| 11 | opelxp 4779 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ (P × P) ↔ (𝐴 ∈ P ∧ 𝐵 ∈ P)) | |
| 12 | 10, 11 | sylib 122 | . 2 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R → (𝐴 ∈ P ∧ 𝐵 ∈ P)) |
| 13 | ltrelpr 7820 | . . . 4 ⊢ <P ⊆ (P × P) | |
| 14 | 13 | brel 4802 | . . 3 ⊢ (𝐵<P 𝐴 → (𝐵 ∈ P ∧ 𝐴 ∈ P)) |
| 15 | 14 | ancomd 267 | . 2 ⊢ (𝐵<P 𝐴 → (𝐴 ∈ P ∧ 𝐵 ∈ P)) |
| 16 | df-0r 8046 | . . . . 5 ⊢ 0R = [〈1P, 1P〉] ~R | |
| 17 | 16 | breq1i 4116 | . . . 4 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R ↔ [〈1P, 1P〉] ~R <R [〈𝐴, 𝐵〉] ~R ) |
| 18 | 1pr 7869 | . . . . 5 ⊢ 1P ∈ P | |
| 19 | ltsrprg 8062 | . . . . 5 ⊢ (((1P ∈ P ∧ 1P ∈ P) ∧ (𝐴 ∈ P ∧ 𝐵 ∈ P)) → ([〈1P, 1P〉] ~R <R [〈𝐴, 𝐵〉] ~R ↔ (1P +P 𝐵)<P (1P +P 𝐴))) | |
| 20 | 18, 18, 19 | mpanl12 436 | . . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ([〈1P, 1P〉] ~R <R [〈𝐴, 𝐵〉] ~R ↔ (1P +P 𝐵)<P (1P +P 𝐴))) |
| 21 | 17, 20 | bitrid 192 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (0R <R [〈𝐴, 𝐵〉] ~R ↔ (1P +P 𝐵)<P (1P +P 𝐴))) |
| 22 | ltaprg 7934 | . . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P ∧ 1P ∈ P) → (𝐵<P 𝐴 ↔ (1P +P 𝐵)<P (1P +P 𝐴))) | |
| 23 | 18, 22 | mp3an3 1363 | . . . 4 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P) → (𝐵<P 𝐴 ↔ (1P +P 𝐵)<P (1P +P 𝐴))) |
| 24 | 23 | ancoms 268 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐵<P 𝐴 ↔ (1P +P 𝐵)<P (1P +P 𝐴))) |
| 25 | 21, 24 | bitr4d 191 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (0R <R [〈𝐴, 𝐵〉] ~R ↔ 𝐵<P 𝐴)) |
| 26 | 12, 15, 25 | pm5.21nii 712 | 1 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R ↔ 𝐵<P 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2203 〈cop 3692 class class class wbr 4109 × cxp 4747 dom cdm 4749 (class class class)co 6050 Er wer 6764 [cec 6765 / cqs 6766 Pcnp 7606 1Pc1p 7607 +P cpp 7608 <P cltp 7610 ~R cer 7611 Rcnr 7612 0Rc0r 7613 <R cltr 7618 |
| 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 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-iinf 4710 |
| 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 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-tr 4209 df-eprel 4410 df-id 4414 df-po 4417 df-iso 4418 df-iord 4487 df-on 4489 df-suc 4492 df-iom 4713 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-recs 6536 df-irdg 6601 df-1o 6647 df-2o 6648 df-oadd 6651 df-omul 6652 df-er 6767 df-ec 6769 df-qs 6773 df-ni 7619 df-pli 7620 df-mi 7621 df-lti 7622 df-plpq 7659 df-mpq 7660 df-enq 7662 df-nqqs 7663 df-plqqs 7664 df-mqqs 7665 df-1nqqs 7666 df-rq 7667 df-ltnqqs 7668 df-enq0 7739 df-nq0 7740 df-0nq0 7741 df-plq0 7742 df-mq0 7743 df-inp 7781 df-i1p 7782 df-iplp 7783 df-iltp 7785 df-enr 8041 df-nr 8042 df-ltr 8045 df-0r 8046 |
| This theorem is referenced by: recexgt0sr 8088 mulgt0sr 8093 srpospr 8098 prsrpos 8100 |
| Copyright terms: Public domain | W3C validator |