Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > raldifeq | Structured version Visualization version Unicode version |
Description: Equality theorem for restricted universal quantifier. (Contributed by Thierry Arnoux, 6-Jul-2019.) |
Ref | Expression |
---|---|
raldifeq.1 | |
raldifeq.2 |
Ref | Expression |
---|---|
raldifeq |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | raldifeq.2 | . . . 4 | |
2 | 1 | biantrud 528 | . . 3 |
3 | ralunb 3794 | . . 3 | |
4 | 2, 3 | syl6bbr 278 | . 2 |
5 | raldifeq.1 | . . . 4 | |
6 | undif 4049 | . . . 4 | |
7 | 5, 6 | sylib 208 | . . 3 |
8 | 7 | raleqdv 3144 | . 2 |
9 | 4, 8 | bitrd 268 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wa 384 wceq 1483 wral 2912 cdif 3571 cun 3572 wss 3574 |
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-11 2034 ax-12 2047 ax-13 2246 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-nfc 2753 df-ral 2917 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 |
This theorem is referenced by: cantnfrescl 8573 rrxmet 23191 ntrneiel2 38384 ntrneik4w 38398 |
Copyright terms: Public domain | W3C validator |