| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elimge0 | Structured version Visualization version GIF version | ||
| Description: Hypothesis for weak deduction theorem to eliminate 0 ≤ 𝐴. (Contributed by NM, 30-Jul-1999.) |
| Ref | Expression |
|---|---|
| elimge0 | ⊢ 0 ≤ if(0 ≤ 𝐴, 𝐴, 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq2 5112 | . 2 ⊢ (𝐴 = if(0 ≤ 𝐴, 𝐴, 0) → (0 ≤ 𝐴 ↔ 0 ≤ if(0 ≤ 𝐴, 𝐴, 0))) | |
| 2 | breq2 5112 | . 2 ⊢ (0 = if(0 ≤ 𝐴, 𝐴, 0) → (0 ≤ 0 ↔ 0 ≤ if(0 ≤ 𝐴, 𝐴, 0))) | |
| 3 | 0re 11216 | . . 3 ⊢ 0 ∈ ℝ | |
| 4 | 3 | leidi 11754 | . 2 ⊢ 0 ≤ 0 |
| 5 | 1, 2, 4 | elimhyp 4552 | 1 ⊢ 0 ≤ if(0 ≤ 𝐴, 𝐴, 0) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ifcif 4486 class class class wbr 5108 0cc0 11106 ≤ cle 11250 |
| 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-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-resscn 11163 ax-1cn 11164 ax-addrcl 11167 ax-rnegex 11177 ax-cnre 11179 ax-pre-lttri 11180 |
| 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-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |