| 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 7802 | . . . . 5 ⊢ ~R Er (P × P) | |
| 2 | erdm 6602 | . . . . 5 ⊢ ( ~R Er (P × P) → dom ~R = (P × P)) | |
| 3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ dom ~R = (P × P) |
| 4 | ltrelsr 7805 | . . . . . . 7 ⊢ <R ⊆ (R × R) | |
| 5 | 4 | brel 4715 | . . . . . 6 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R → (0R ∈ R ∧ [〈𝐴, 𝐵〉] ~R ∈ R)) |
| 6 | 5 | simprd 114 | . . . . 5 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R → [〈𝐴, 𝐵〉] ~R ∈ R) |
| 7 | df-nr 7794 | . . . . 5 ⊢ R = ((P × P) / ~R ) | |
| 8 | 6, 7 | eleqtrdi 2289 | . . . 4 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R → [〈𝐴, 𝐵〉] ~R ∈ ((P × P) / ~R )) |
| 9 | ecelqsdm 6664 | . . . 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 4693 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ (P × P) ↔ (𝐴 ∈ P ∧ 𝐵 ∈ P)) | |
| 12 | 10, 11 | sylib 122 | . 2 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R → (𝐴 ∈ P ∧ 𝐵 ∈ P)) |
| 13 | ltrelpr 7572 | . . . 4 ⊢ <P ⊆ (P × P) | |
| 14 | 13 | brel 4715 | . . 3 ⊢ (𝐵<P 𝐴 → (𝐵 ∈ P ∧ 𝐴 ∈ P)) |
| 15 | 14 | ancomd 267 | . 2 ⊢ (𝐵<P 𝐴 → (𝐴 ∈ P ∧ 𝐵 ∈ P)) |
| 16 | df-0r 7798 | . . . . 5 ⊢ 0R = [〈1P, 1P〉] ~R | |
| 17 | 16 | breq1i 4040 | . . . 4 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R ↔ [〈1P, 1P〉] ~R <R [〈𝐴, 𝐵〉] ~R ) |
| 18 | 1pr 7621 | . . . . 5 ⊢ 1P ∈ P | |
| 19 | ltsrprg 7814 | . . . . 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 7686 | . . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝐴 ∈ P ∧ 1P ∈ P) → (𝐵<P 𝐴 ↔ (1P +P 𝐵)<P (1P +P 𝐴))) | |
| 23 | 18, 22 | mp3an3 1337 | . . . 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 705 | 1 ⊢ (0R <R [〈𝐴, 𝐵〉] ~R ↔ 𝐵<P 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2167 〈cop 3625 class class class wbr 4033 × cxp 4661 dom cdm 4663 (class class class)co 5922 Er wer 6589 [cec 6590 / cqs 6591 Pcnp 7358 1Pc1p 7359 +P cpp 7360 <P cltp 7362 ~R cer 7363 Rcnr 7364 0Rc0r 7365 <R cltr 7370 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4148 ax-sep 4151 ax-nul 4159 ax-pow 4207 ax-pr 4242 ax-un 4468 ax-setind 4573 ax-iinf 4624 |
| This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-ral 2480 df-rex 2481 df-reu 2482 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3451 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-uni 3840 df-int 3875 df-iun 3918 df-br 4034 df-opab 4095 df-mpt 4096 df-tr 4132 df-eprel 4324 df-id 4328 df-po 4331 df-iso 4332 df-iord 4401 df-on 4403 df-suc 4406 df-iom 4627 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-rn 4674 df-res 4675 df-ima 4676 df-iota 5219 df-fun 5260 df-fn 5261 df-f 5262 df-f1 5263 df-fo 5264 df-f1o 5265 df-fv 5266 df-ov 5925 df-oprab 5926 df-mpo 5927 df-1st 6198 df-2nd 6199 df-recs 6363 df-irdg 6428 df-1o 6474 df-2o 6475 df-oadd 6478 df-omul 6479 df-er 6592 df-ec 6594 df-qs 6598 df-ni 7371 df-pli 7372 df-mi 7373 df-lti 7374 df-plpq 7411 df-mpq 7412 df-enq 7414 df-nqqs 7415 df-plqqs 7416 df-mqqs 7417 df-1nqqs 7418 df-rq 7419 df-ltnqqs 7420 df-enq0 7491 df-nq0 7492 df-0nq0 7493 df-plq0 7494 df-mq0 7495 df-inp 7533 df-i1p 7534 df-iplp 7535 df-iltp 7537 df-enr 7793 df-nr 7794 df-ltr 7797 df-0r 7798 |
| This theorem is referenced by: recexgt0sr 7840 mulgt0sr 7845 srpospr 7850 prsrpos 7852 |
| Copyright terms: Public domain | W3C validator |