| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > nadd2rabord | Structured version Visualization version GIF version | ||
| Description: The set of ordinals which have a natural sum less than some ordinal is an ordinal. (Contributed by RP, 20-Dec-2024.) |
| Ref | Expression |
|---|---|
| nadd2rabord | ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → Ord {𝑥 ∈ 𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrab2 4021 | . . 3 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶} ⊆ 𝐴 | |
| 2 | ordsson 7728 | . . . 4 ⊢ (Ord 𝐴 → 𝐴 ⊆ On) | |
| 3 | 2 | 3ad2ant1 1134 | . . 3 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → 𝐴 ⊆ On) |
| 4 | 1, 3 | sstrid 3934 | . 2 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → {𝑥 ∈ 𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶} ⊆ On) |
| 5 | nadd2rabtr 43815 | . 2 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → Tr {𝑥 ∈ 𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶}) | |
| 6 | dford5 7729 | . 2 ⊢ (Ord {𝑥 ∈ 𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶} ↔ ({𝑥 ∈ 𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶} ⊆ On ∧ Tr {𝑥 ∈ 𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶})) | |
| 7 | 4, 5, 6 | sylanbrc 584 | 1 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → Ord {𝑥 ∈ 𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 ∈ wcel 2114 {crab 3390 ⊆ wss 3890 Tr wtr 5193 Ord word 6314 Oncon0 6315 (class class class)co 7358 +no cnadd 8592 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-se 5576 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-frecs 8222 df-nadd 8593 |
| This theorem is referenced by: nadd2rabon 43818 |
| Copyright terms: Public domain | W3C validator |