| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Formula-building rule for 4 existential quantifiers (deduction rule). |
| Ref | Expression |
|---|---|
| 4exbidv.1 |
|
| Ref | Expression |
|---|---|
| 4exbidv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 4exbidv.1 |
. . 3
| |
| 2 | 1 | 2exbidv 1283 |
. 2
|
| 3 | 2 | 2exbidv 1283 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: copsex4g 2800 opbrop 3244 oprabval3 4036 brecop 4312 th3q 4323 elo 10439 eloi 10630 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 965 ax-17 973 ax-4 975 ax-5o 977 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 983 |