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 5070 | . . 3 ⊢ (𝐴 ≤ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≤ ) | |
2 | opelxpi 5595 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → 〈𝐴, 𝐵〉 ∈ (ℝ* × ℝ*)) | |
3 | df-le 10684 | . . . . . . 7 ⊢ ≤ = ((ℝ* × ℝ*) ∖ ◡ < ) | |
4 | 3 | eleq2i 2907 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 ∈ ≤ ↔ 〈𝐴, 𝐵〉 ∈ ((ℝ* × ℝ*) ∖ ◡ < )) |
5 | eldif 3949 | . . . . . 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 5754 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (〈𝐴, 𝐵〉 ∈ ◡ < ↔ 〈𝐵, 𝐴〉 ∈ < )) | |
11 | df-br 5070 | . . . 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 2113 ∖ cdif 3936 〈cop 4576 class class class wbr 5069 × cxp 5556 ◡ccnv 5557 ℝ*cxr 10677 < clt 10678 ≤ cle 10679 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-br 5070 df-opab 5132 df-xp 5564 df-cnv 5566 df-le 10684 |
This theorem is referenced by: xrlenltd 10710 xrltnle 10711 lenlt 10722 pnfge 12528 mnfle 12532 xrleloe 12540 xrltlen 12542 xrletri3 12550 xgepnf 12561 xlemnf 12563 xralrple 12601 xleneg 12614 supxr2 12710 supxrbnd1 12717 supxrbnd2 12718 supxrleub 12722 supxrbnd 12724 infxrgelb 12731 ioon0 12767 iccid 12786 icc0 12789 icoun 12864 ioounsn 12866 snunico 12868 ioodisj 12871 ioojoin 12872 hashgt0elex 13765 hashgt12el 13786 hashgt12el2 13787 0ringnnzr 20045 lecldbas 21830 xmetgt0 22971 icopnfcld 23379 ioombl 24169 vitalilem4 24215 itg2gt0 24364 nmlnogt0 28577 xrlelttric 30479 xrsupssd 30486 xrge0infss 30487 joiniooico 30500 xeqlelt 30502 iocinif 30507 esumsnf 31327 esum2d 31356 oms0 31559 omssubadd 31562 cusgracyclt3v 32407 relowlpssretop 34649 mblfinlem3 34935 mblfinlem4 34936 ismblfin 34937 asindmre 34981 iocmbl 39825 supxrgere 41607 iccdifprioo 41798 iccpartnel 43605 |
Copyright terms: Public domain | W3C validator |