Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mobid | Unicode version |
Description: Formula-building rule for "at most one" quantifier (deduction form). (Contributed by NM, 8-Mar-1995.) |
Ref | Expression |
---|---|
mobid.1 | |
mobid.2 |
Ref | Expression |
---|---|
mobid |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mobid.1 | . . . 4 | |
2 | mobid.2 | . . . 4 | |
3 | 1, 2 | exbid 1603 | . . 3 |
4 | 1, 2 | eubid 2020 | . . 3 |
5 | 3, 4 | imbi12d 233 | . 2 |
6 | df-mo 2017 | . 2 | |
7 | df-mo 2017 | . 2 | |
8 | 5, 6, 7 | 3bitr4g 222 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wnf 1447 wex 1479 weu 2013 wmo 2014 |
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-5 1434 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-4 1497 ax-17 1513 ax-ial 1521 |
This theorem depends on definitions: df-bi 116 df-nf 1448 df-eu 2016 df-mo 2017 |
This theorem is referenced by: mobidv 2049 rmobida 2650 rmoeq1f 2658 |
Copyright terms: Public domain | W3C validator |