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 5075 | . . 3 ⊢ (𝐴 ≤ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≤ ) | |
2 | opelxpi 5626 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → 〈𝐴, 𝐵〉 ∈ (ℝ* × ℝ*)) | |
3 | df-le 11015 | . . . . . . 7 ⊢ ≤ = ((ℝ* × ℝ*) ∖ ◡ < ) | |
4 | 3 | eleq2i 2830 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 ∈ ≤ ↔ 〈𝐴, 𝐵〉 ∈ ((ℝ* × ℝ*) ∖ ◡ < )) |
5 | eldif 3897 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 ∈ ((ℝ* × ℝ*) ∖ ◡ < ) ↔ (〈𝐴, 𝐵〉 ∈ (ℝ* × ℝ*) ∧ ¬ 〈𝐴, 𝐵〉 ∈ ◡ < )) | |
6 | 4, 5 | bitri 274 | . . . . 5 ⊢ (〈𝐴, 𝐵〉 ∈ ≤ ↔ (〈𝐴, 𝐵〉 ∈ (ℝ* × ℝ*) ∧ ¬ 〈𝐴, 𝐵〉 ∈ ◡ < )) |
7 | 6 | baib 536 | . . . 4 ⊢ (〈𝐴, 𝐵〉 ∈ (ℝ* × ℝ*) → (〈𝐴, 𝐵〉 ∈ ≤ ↔ ¬ 〈𝐴, 𝐵〉 ∈ ◡ < )) |
8 | 2, 7 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (〈𝐴, 𝐵〉 ∈ ≤ ↔ ¬ 〈𝐴, 𝐵〉 ∈ ◡ < )) |
9 | 1, 8 | bitrid 282 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐵 ↔ ¬ 〈𝐴, 𝐵〉 ∈ ◡ < )) |
10 | df-br 5075 | . . . 4 ⊢ (𝐵 < 𝐴 ↔ 〈𝐵, 𝐴〉 ∈ < ) | |
11 | opelcnvg 5789 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (〈𝐴, 𝐵〉 ∈ ◡ < ↔ 〈𝐵, 𝐴〉 ∈ < )) | |
12 | 10, 11 | bitr4id 290 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐵 < 𝐴 ↔ 〈𝐴, 𝐵〉 ∈ ◡ < )) |
13 | 12 | notbid 318 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (¬ 𝐵 < 𝐴 ↔ ¬ 〈𝐴, 𝐵〉 ∈ ◡ < )) |
14 | 9, 13 | bitr4d 281 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∈ wcel 2106 ∖ cdif 3884 〈cop 4567 class class class wbr 5074 × cxp 5587 ◡ccnv 5588 ℝ*cxr 11008 < clt 11009 ≤ cle 11010 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 df-opab 5137 df-xp 5595 df-cnv 5597 df-le 11015 |
This theorem is referenced by: xrlenltd 11041 xrltnle 11042 lenlt 11053 pnfge 12866 mnfle 12870 xrleloe 12878 xrltlen 12880 xrletri3 12888 xgepnf 12899 xlemnf 12901 xralrple 12939 xleneg 12952 supxr2 13048 supxrbnd1 13055 supxrbnd2 13056 supxrleub 13060 supxrbnd 13062 infxrgelb 13069 ioon0 13105 iccid 13124 icc0 13127 icoun 13207 ioounsn 13209 snunico 13211 ioodisj 13214 ioojoin 13215 hashgt0elex 14116 hashgt12el 14137 hashgt12el2 14138 0ringnnzr 20540 lecldbas 22370 xmetgt0 23511 icopnfcld 23931 ioombl 24729 vitalilem4 24775 itg2gt0 24925 nmlnogt0 29159 xrlelttric 31075 xrsupssd 31082 xrge0infss 31083 joiniooico 31095 xeqlelt 31097 iocinif 31102 esumsnf 32032 esum2d 32061 oms0 32264 omssubadd 32267 cusgracyclt3v 33118 relowlpssretop 35535 mblfinlem3 35816 mblfinlem4 35817 ismblfin 35818 asindmre 35860 dvrelog2b 40074 iocmbl 41044 supxrgere 42872 iccdifprioo 43054 iccpartnel 44890 iccdisj2 46191 |
Copyright terms: Public domain | W3C validator |