| Mathbox for David A. Wheeler |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > gte-lte | Structured version Visualization version GIF version | ||
| Description: Simple relationship between ≤ and ≥. (Contributed by David A. Wheeler, 10-May-2015.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| gte-lte | ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ≥ 𝐵 ↔ 𝐵 ≤ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-gte 50528 | . . 3 ⊢ ≥ = ◡ ≤ | |
| 2 | 1 | breqi 5114 | . 2 ⊢ (𝐴 ≥ 𝐵 ↔ 𝐴◡ ≤ 𝐵) |
| 3 | brcnvg 5864 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴◡ ≤ 𝐵 ↔ 𝐵 ≤ 𝐴)) | |
| 4 | 2, 3 | bitrid 286 | 1 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ≥ 𝐵 ↔ 𝐵 ≤ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2142 Vcvv 3454 class class class wbr 5108 ◡ccnv 5659 ≤ cle 11250 ≥ cge-real 50526 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5256 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-br 5109 df-opab 5173 df-cnv 5668 df-gte 50528 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |