Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ovanraleqv | Unicode version |
Description: Equality theorem for a conjunction with an operation values within a restricted universal quantification. Technical theorem to be used to reduce the size of a significant number of proofs. (Contributed by AV, 13-Aug-2022.) |
Ref | Expression |
---|---|
ovanraleqv.1 |
Ref | Expression |
---|---|
ovanraleqv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ovanraleqv.1 | . . 3 | |
2 | oveq2 5775 | . . . 4 | |
3 | 2 | eqeq1d 2146 | . . 3 |
4 | 1, 3 | anbi12d 464 | . 2 |
5 | 4 | ralbidv 2435 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wceq 1331 wral 2414 (class class class)co 5767 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ral 2419 df-rex 2420 df-v 2683 df-un 3070 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-br 3925 df-iota 5083 df-fv 5126 df-ov 5770 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |