| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Formula-building rule for 2 existential quantifiers (deduction rule). |
| Ref | Expression |
|---|---|
| 2albidv.1 |
|
| Ref | Expression |
|---|---|
| 2exbidv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2albidv.1 |
. . 3
| |
| 2 | 1 | exbidv 1279 |
. 2
|
| 3 | 2 | exbidv 1279 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: 3exbidv 1282 4exbidv 1283 cbvex4v 1322 copsexg 2792 elopab 2811 relop 3275 cbvoprab3v 4000 oprabval6g 4032 th3qlem1 4314 genpv 5102 genpelv 5103 genpprecl 5104 genpnnp 5108 genpass 5112 distrlem1pr 5127 distrlem5pr 5131 ltresr 5258 bsi 10495 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 963 ax-17 971 ax-4 973 ax-5o 975 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 981 |