| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Specialized existential commutation lemma. (Contributed by Jeff Madsen, 1-Jun-2011.) |
| Ref | Expression |
|---|---|
| rexcom4b.1 |
|
| Ref | Expression |
|---|---|
| rexcom4b |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexcom4a 10147 |
. 2
| |
| 2 | rexcom4b.1 |
. . . . 5
| |
| 3 | 2 | isseti 2297 |
. . . 4
|
| 4 | 3 | biantru 793 |
. . 3
|
| 5 | 4 | rexbii 2128 |
. 2
|
| 6 | 1, 5 | bitr4i 193 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1304 ax-gen 1305 ax-12 1310 ax-17 1317 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-ext 1865 |
| This theorem depends on definitions: df-bi 164 df-an 242 df-ex 1327 df-sb 1536 df-clab 1872 df-cleq 1877 df-clel 1880 df-rex 2110 df-v 2294 |