| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2mos | Structured version Visualization version Unicode version | ||
| Description: Double "exists at most one", using implicit substitution. (Contributed by NM, 10-Feb-2005.) |
| Ref | Expression |
|---|---|
| 2mos.1 |
|
| Ref | Expression |
|---|---|
| 2mos |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2mo 2551 |
. 2
| |
| 2 | nfv 1843 |
. . . . . . 7
| |
| 3 | 2mos.1 |
. . . . . . . 8
| |
| 4 | 3 | sbiedv 2410 |
. . . . . . 7
|
| 5 | 2, 4 | sbie 2408 |
. . . . . 6
|
| 6 | 5 | anbi2i 730 |
. . . . 5
|
| 7 | 6 | imbi1i 339 |
. . . 4
|
| 8 | 7 | 2albii 1748 |
. . 3
|
| 9 | 8 | 2albii 1748 |
. 2
|
| 10 | 1, 9 | bitri 264 |
1
|
| Colors of variables: wff setvar class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 |
| This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |