Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ceqsrexbv | Structured version Visualization version Unicode version |
Description: Elimination of a restricted existential quantifier, using implicit substitution. (Contributed by Mario Carneiro, 14-Mar-2014.) |
Ref | Expression |
---|---|
ceqsrexv.1 |
Ref | Expression |
---|---|
ceqsrexbv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | r19.42v 3092 | . 2 | |
2 | eleq1 2689 | . . . . . . 7 | |
3 | 2 | adantr 481 | . . . . . 6 |
4 | 3 | pm5.32ri 670 | . . . . 5 |
5 | 4 | bicomi 214 | . . . 4 |
6 | 5 | baib 944 | . . 3 |
7 | 6 | rexbiia 3040 | . 2 |
8 | ceqsrexv.1 | . . . 4 | |
9 | 8 | ceqsrexv 3336 | . . 3 |
10 | 9 | pm5.32i 669 | . 2 |
11 | 1, 7, 10 | 3bitr3i 290 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wa 384 wceq 1483 wcel 1990 wrex 2913 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-12 2047 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-rex 2918 df-v 3202 |
This theorem is referenced by: marypha2lem2 8342 txkgen 21455 ceqsrexv2 31605 eq0rabdioph 37340 |
Copyright terms: Public domain | W3C validator |