Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > xrlenlt | Structured version Visualization version GIF version |
Description: "Less than or equal to" expressed in terms of "less than", for extended reals. (Contributed by NM, 14-Oct-2005.) |
Ref | Expression |
---|---|
xrlenlt | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-br 5067 | . . 3 ⊢ (𝐴 ≤ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≤ ) | |
2 | opelxpi 5592 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → 〈𝐴, 𝐵〉 ∈ (ℝ* × ℝ*)) | |
3 | df-le 10681 | . . . . . . 7 ⊢ ≤ = ((ℝ* × ℝ*) ∖ ◡ < ) | |
4 | 3 | eleq2i 2904 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 ∈ ≤ ↔ 〈𝐴, 𝐵〉 ∈ ((ℝ* × ℝ*) ∖ ◡ < )) |
5 | eldif 3946 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 ∈ ((ℝ* × ℝ*) ∖ ◡ < ) ↔ (〈𝐴, 𝐵〉 ∈ (ℝ* × ℝ*) ∧ ¬ 〈𝐴, 𝐵〉 ∈ ◡ < )) | |
6 | 4, 5 | bitri 277 | . . . . 5 ⊢ (〈𝐴, 𝐵〉 ∈ ≤ ↔ (〈𝐴, 𝐵〉 ∈ (ℝ* × ℝ*) ∧ ¬ 〈𝐴, 𝐵〉 ∈ ◡ < )) |
7 | 6 | baib 538 | . . . 4 ⊢ (〈𝐴, 𝐵〉 ∈ (ℝ* × ℝ*) → (〈𝐴, 𝐵〉 ∈ ≤ ↔ ¬ 〈𝐴, 𝐵〉 ∈ ◡ < )) |
8 | 2, 7 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (〈𝐴, 𝐵〉 ∈ ≤ ↔ ¬ 〈𝐴, 𝐵〉 ∈ ◡ < )) |
9 | 1, 8 | syl5bb 285 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐵 ↔ ¬ 〈𝐴, 𝐵〉 ∈ ◡ < )) |
10 | opelcnvg 5751 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (〈𝐴, 𝐵〉 ∈ ◡ < ↔ 〈𝐵, 𝐴〉 ∈ < )) | |
11 | df-br 5067 | . . . 4 ⊢ (𝐵 < 𝐴 ↔ 〈𝐵, 𝐴〉 ∈ < ) | |
12 | 10, 11 | syl6rbbr 292 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐵 < 𝐴 ↔ 〈𝐴, 𝐵〉 ∈ ◡ < )) |
13 | 12 | notbid 320 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (¬ 𝐵 < 𝐴 ↔ ¬ 〈𝐴, 𝐵〉 ∈ ◡ < )) |
14 | 9, 13 | bitr4d 284 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∈ wcel 2114 ∖ cdif 3933 〈cop 4573 class class class wbr 5066 × cxp 5553 ◡ccnv 5554 ℝ*cxr 10674 < clt 10675 ≤ cle 10676 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-br 5067 df-opab 5129 df-xp 5561 df-cnv 5563 df-le 10681 |
This theorem is referenced by: xrlenltd 10707 xrltnle 10708 lenlt 10719 pnfge 12526 mnfle 12530 xrleloe 12538 xrltlen 12540 xrletri3 12548 xgepnf 12559 xlemnf 12561 xralrple 12599 xleneg 12612 supxr2 12708 supxrbnd1 12715 supxrbnd2 12716 supxrleub 12720 supxrbnd 12722 infxrgelb 12729 ioon0 12765 iccid 12784 icc0 12787 icoun 12862 ioounsn 12864 snunico 12866 ioodisj 12869 ioojoin 12870 hashgt0elex 13763 hashgt12el 13784 hashgt12el2 13785 0ringnnzr 20042 lecldbas 21827 xmetgt0 22968 icopnfcld 23376 ioombl 24166 vitalilem4 24212 itg2gt0 24361 nmlnogt0 28574 xrlelttric 30476 xrsupssd 30483 xrge0infss 30484 joiniooico 30497 xeqlelt 30499 iocinif 30504 esumsnf 31323 esum2d 31352 oms0 31555 omssubadd 31558 cusgracyclt3v 32403 relowlpssretop 34648 mblfinlem3 34946 mblfinlem4 34947 ismblfin 34948 asindmre 34992 iocmbl 39839 supxrgere 41621 iccdifprioo 41812 iccpartnel 43618 |
Copyright terms: Public domain | W3C validator |