| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > raleqtrdv | Unicode version | ||
| Description: Substitution of equal classes into a restricted universal quantifier. (Contributed by Matthew House, 21-Jul-2025.) |
| Ref | Expression |
|---|---|
| raleqtrdv.1 |
|
| raleqtrdv.2 |
|
| Ref | Expression |
|---|---|
| raleqtrdv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | raleqtrdv.1 |
. 2
| |
| 2 | raleqtrdv.2 |
. . 3
| |
| 3 | 2 | raleqdv 2714 |
. 2
|
| 4 | 1, 3 | mpbid 147 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-ext 2191 |
| This theorem depends on definitions: df-bi 117 df-tru 1378 df-nf 1487 df-sb 1789 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ral 2493 |
| This theorem is referenced by: znf1o 14580 |
| Copyright terms: Public domain | W3C validator |