| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Formula-building rule for restricted existential quantifier (inference rule). |
| Ref | Expression |
|---|---|
| reubii.1 |
|
| Ref | Expression |
|---|---|
| reubii |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reubii.1 |
. . 3
| |
| 2 | 1 | a1i 8 |
. 2
|
| 3 | 2 | reubiia 1781 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: aceq2 4731 infmsup 6068 uzwo3 6218 cnlnadjlem3 10002 cnlnadjlem4 10003 cnlnadjlem5 10004 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 963 ax-12 968 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 981 df-eu 1382 df-reu 1651 |