![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > exbid | Unicode version |
Description: Formula-building rule for existential quantifier (deduction rule). (Contributed by Mario Carneiro, 24-Sep-2016.) |
Ref | Expression |
---|---|
exbid.1 |
![]() ![]() ![]() ![]() |
exbid.2 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
exbid |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | exbid.1 |
. . 3
![]() ![]() ![]() ![]() | |
2 | 1 | nfri 1409 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
3 | exbid.2 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
4 | 2, 3 | exbidh 1502 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() ![]() |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-5 1333 ax-gen 1335 ax-ie1 1379 ax-ie2 1380 ax-4 1397 ax-ial 1424 |
This theorem depends on definitions: df-bi 110 df-nf 1347 |
This theorem is referenced by: mobid 1932 rexbida 2315 rexeqf 2496 opabbid 3813 repizf2 3906 oprabbid 5500 sscoll2 9448 |
Copyright terms: Public domain | W3C validator |