![]() |
Mathbox for BJ |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > Mathboxes > bdeqsuc | GIF version |
Description: Boundedness of the formula expressing that a setvar is equal to the successor of another. (Contributed by BJ, 21-Nov-2019.) |
Ref | Expression |
---|---|
bdeqsuc | ⊢ BOUNDED 𝑥 = suc 𝑦 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bdcsuc 13249 | . . . 4 ⊢ BOUNDED suc 𝑦 | |
2 | 1 | bdss 13233 | . . 3 ⊢ BOUNDED 𝑥 ⊆ suc 𝑦 |
3 | bdcv 13217 | . . . . . . 7 ⊢ BOUNDED 𝑥 | |
4 | 3 | bdss 13233 | . . . . . 6 ⊢ BOUNDED 𝑦 ⊆ 𝑥 |
5 | 3 | bdsnss 13242 | . . . . . 6 ⊢ BOUNDED {𝑦} ⊆ 𝑥 |
6 | 4, 5 | ax-bdan 13184 | . . . . 5 ⊢ BOUNDED (𝑦 ⊆ 𝑥 ∧ {𝑦} ⊆ 𝑥) |
7 | unss 3255 | . . . . 5 ⊢ ((𝑦 ⊆ 𝑥 ∧ {𝑦} ⊆ 𝑥) ↔ (𝑦 ∪ {𝑦}) ⊆ 𝑥) | |
8 | 6, 7 | bd0 13193 | . . . 4 ⊢ BOUNDED (𝑦 ∪ {𝑦}) ⊆ 𝑥 |
9 | df-suc 4301 | . . . . 5 ⊢ suc 𝑦 = (𝑦 ∪ {𝑦}) | |
10 | 9 | sseq1i 3128 | . . . 4 ⊢ (suc 𝑦 ⊆ 𝑥 ↔ (𝑦 ∪ {𝑦}) ⊆ 𝑥) |
11 | 8, 10 | bd0r 13194 | . . 3 ⊢ BOUNDED suc 𝑦 ⊆ 𝑥 |
12 | 2, 11 | ax-bdan 13184 | . 2 ⊢ BOUNDED (𝑥 ⊆ suc 𝑦 ∧ suc 𝑦 ⊆ 𝑥) |
13 | eqss 3117 | . 2 ⊢ (𝑥 = suc 𝑦 ↔ (𝑥 ⊆ suc 𝑦 ∧ suc 𝑦 ⊆ 𝑥)) | |
14 | 12, 13 | bd0r 13194 | 1 ⊢ BOUNDED 𝑥 = suc 𝑦 |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 = wceq 1332 ∪ cun 3074 ⊆ wss 3076 {csn 3532 suc csuc 4295 BOUNDED wbd 13181 |
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 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-bd0 13182 ax-bdan 13184 ax-bdor 13185 ax-bdal 13187 ax-bdeq 13189 ax-bdel 13190 ax-bdsb 13191 |
This theorem depends on definitions: df-bi 116 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ral 2422 df-v 2691 df-un 3080 df-in 3082 df-ss 3089 df-sn 3538 df-suc 4301 df-bdc 13210 |
This theorem is referenced by: bj-bdsucel 13251 bj-nn0suc0 13319 |
Copyright terms: Public domain | W3C validator |