| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Commutation of restricted and unrestricted existential quantifiers. |
| Ref | Expression |
|---|---|
| rexcom4 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexcom 1775 |
. 2
| |
| 2 | rexv 1821 |
. 2
| |
| 3 | rexv 1821 |
. . 3
| |
| 4 | 3 | rexbii 1668 |
. 2
|
| 5 | 1, 2, 4 | 3bitr3r 182 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: uni0b 2523 cnvuni 3301 imaco 3501 aceq5lem2 4736 infcvglem1 7221 nmcopexlem1 9951 nmcfnexlem1 9980 ntunte 10439 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 962 ax-gen 963 ax-12 968 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 ax-ext 1459 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 981 df-sb 1172 df-clab 1464 df-cleq 1469 df-clel 1472 df-rex 1650 df-v 1812 |