| 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 5115 | . 2 ⊢ (𝐴 = if(0 ≤ 𝐴, 𝐴, 0) → (0 ≤ 𝐴 ↔ 0 ≤ if(0 ≤ 𝐴, 𝐴, 0))) | |
| 2 | breq2 5115 | . 2 ⊢ (0 = if(0 ≤ 𝐴, 𝐴, 0) → (0 ≤ 0 ↔ 0 ≤ if(0 ≤ 𝐴, 𝐴, 0))) | |
| 3 | 0re 11210 | . . 3 ⊢ 0 ∈ ℝ | |
| 4 | 3 | leidi 11748 | . 2 ⊢ 0 ≤ 0 |
| 5 | 1, 2, 4 | elimhyp 4556 | 1 ⊢ 0 ≤ if(0 ≤ 𝐴, 𝐴, 0) |
| Colors of variables: wff setvar class |
| Syntax hints: ifcif 4490 class class class wbr 5111 0cc0 11100 ≤ cle 11244 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-resscn 11157 ax-1cn 11158 ax-addrcl 11161 ax-rnegex 11171 ax-cnre 11173 ax-pre-lttri 11174 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |