| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > bdctp | Unicode version | ||
| Description: The unordered triple of three setvars is bounded. (Contributed by BJ, 16-Oct-2019.) |
| Ref | Expression |
|---|---|
| bdctp |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bdcpr 15601 |
. . 3
| |
| 2 | bdcsn 15600 |
. . 3
| |
| 3 | 1, 2 | bdcun 15592 |
. 2
|
| 4 | df-tp 3631 |
. 2
| |
| 5 | 3, 4 | bdceqir 15574 |
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-5 1461 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-4 1524 ax-17 1540 ax-ial 1548 ax-ext 2178 ax-bd0 15543 ax-bdor 15546 ax-bdeq 15550 ax-bdsb 15552 |
| This theorem depends on definitions: df-bi 117 df-clab 2183 df-cleq 2189 df-clel 2192 df-un 3161 df-sn 3629 df-pr 3630 df-tp 3631 df-bdc 15571 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |