| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Inference adding restricted universal quantifier to both sides of an equivalence. |
| Ref | Expression |
|---|---|
| ralbiia.1 |
|
| Ref | Expression |
|---|---|
| ralbiia |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ralbiia.1 |
. . 3
| |
| 2 | 1 | pm5.74i 586 |
. 2
|
| 3 | 2 | ralbii2 1674 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: funcnv3 3564 fncnv 3567 fvreseq 3805 aceq4 4744 brdom7disj 4814 brdom6disj 4815 iundom 4822 cau2 6913 clmnns 7084 climres 7105 climshft2 7106 isumnn0nna 7208 isummulc1a 7214 cvgratlem3ALT 7249 cvgratlem3 7252 negfcncf 7269 efaddlem27 7364 metreslem 7819 lmbrnns 7939 lmcvgnns 7940 hods 9696 ho01 9749 ho02 9750 lnopeq 9928 nmcopexlem2 9947 lnopcon 9958 nmcfnexlem2 9976 lnfncon 9985 cnlnadjlem3 9997 cnlnadjlem4 9998 cnlnadjlem5 9999 leop3t 10053 pjsspos 10095 large 10189 mdsl2 10244 mdsl2b 10245 elat2 10262 dmdbr5at 10344 cdj3lem3b 10362 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 965 ax-4 975 ax-5o 977 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ral 1652 |