| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Inference absorbing redundant antecedent. (The proof was shortened by O'Cat, 3-Feb-2006.) |
| Ref | Expression |
|---|---|
| pm2.43a.1 |
|
| Ref | Expression |
|---|---|
| pm2.43a |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-1 4 |
. 2
| |
| 2 | pm2.43a.1 |
. 2
| |
| 3 | 1, 2 | mpdd 46 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: pm2.43b 67 ra4sbc 1997 intss1 2548 ordsucelsuc 3073 fneu 3592 tz6.12i 3741 fvopab3ig 3778 fvopab2 3791 odi 4210 inf3lem2 4614 rankr1 4674 zorn2lem7 4794 prlem936b 5154 reclem3pr 5158 uzind2 6206 uzindOLD 6208 sqlecant 6641 chcmh 9113 uninqs 10441 fiv 10482 fivOLD 10483 cnvhmphb 10526 homcard 10539 cnfilca 10583 cnfilcaOLD 10584 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-mp 7 |