| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > bdcv | GIF version | ||
| Description: A setvar is a bounded class. (Contributed by BJ, 3-Oct-2019.) |
| Ref | Expression |
|---|---|
| bdcv | ⊢ BOUNDED 𝑥 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-bdel 16969 | . 2 ⊢ BOUNDED 𝑦 ∈ 𝑥 | |
| 2 | 1 | bdelir 16995 | 1 ⊢ BOUNDED 𝑥 |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: BOUNDED wbdc 16988 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-gen 1502 ax-bdel 16969 |
| This proof depends on definitions: df-bi 117 df-bdc 16989 |
| This theorem is used by: bdvsn 17022 bdcsuc 17028 bdeqsuc 17029 bj-inex 17055 bj-nntrans 17099 bj-omtrans 17104 bj-inf2vn 17122 bj-omex2 17125 bj-nn0sucALT 17126 |
| Copyright terms: Public domain | W3C validator |