![]() |
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 5152 | . 2 ⊢ (𝐴 = if(0 ≤ 𝐴, 𝐴, 0) → (0 ≤ 𝐴 ↔ 0 ≤ if(0 ≤ 𝐴, 𝐴, 0))) | |
2 | breq2 5152 | . 2 ⊢ (0 = if(0 ≤ 𝐴, 𝐴, 0) → (0 ≤ 0 ↔ 0 ≤ if(0 ≤ 𝐴, 𝐴, 0))) | |
3 | 0re 11215 | . . 3 ⊢ 0 ∈ ℝ | |
4 | 3 | leidi 11747 | . 2 ⊢ 0 ≤ 0 |
5 | 1, 2, 4 | elimhyp 4593 | 1 ⊢ 0 ≤ if(0 ≤ 𝐴, 𝐴, 0) |
Colors of variables: wff setvar class |
Syntax hints: ifcif 4528 class class class wbr 5148 0cc0 11109 ≤ cle 11248 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-resscn 11166 ax-1cn 11167 ax-addrcl 11170 ax-rnegex 11180 ax-cnre 11182 ax-pre-lttri 11183 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |