Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mopick2 | Unicode version |
Description: "At most one" can show the existence of a common value. In this case we can infer existence of conjunction from a conjunction of existence, and it is one way to achieve the converse of 19.40 1624. (Contributed by NM, 5-Apr-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) |
Ref | Expression |
---|---|
mopick2 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hbmo1 2057 | . . . 4 | |
2 | hbe1 1488 | . . . 4 | |
3 | 1, 2 | hban 1540 | . . 3 |
4 | mopick 2097 | . . . . . 6 | |
5 | 4 | ancld 323 | . . . . 5 |
6 | 5 | anim1d 334 | . . . 4 |
7 | df-3an 975 | . . . 4 | |
8 | 6, 7 | syl6ibr 161 | . . 3 |
9 | 3, 8 | eximdh 1604 | . 2 |
10 | 9 | 3impia 1195 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 w3a 973 wex 1485 wmo 2020 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |