Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > Mathboxes > decidr | Unicode version |
Description: Sufficient condition for being decidable in another class. (Contributed by BJ, 19-Feb-2022.) |
Ref | Expression |
---|---|
decidr.1 |
Ref | Expression |
---|---|
decidr | DECIDin |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | decidr.1 | . . . 4 | |
2 | df-dc 835 | . . . 4 DECID | |
3 | 1, 2 | syl6ibr 162 | . . 3 DECID |
4 | 3 | alrimiv 1872 | . 2 DECID |
5 | df-dcin 14115 | . . 3 DECIDin DECID | |
6 | df-ral 2458 | . . 3 DECID DECID | |
7 | 5, 6 | bitri 184 | . 2 DECIDin DECID |
8 | 4, 7 | sylibr 134 | 1 DECIDin |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wo 708 DECID wdc 834 wal 1351 wcel 2146 wral 2453 DECIDin wdcin 14114 |
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-5 1445 ax-gen 1447 ax-17 1524 |
This theorem depends on definitions: df-bi 117 df-dc 835 df-ral 2458 df-dcin 14115 |
This theorem is referenced by: decidin 14118 uzdcinzz 14119 sumdc2 14120 |
Copyright terms: Public domain | W3C validator |