Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > oacl | GIF version |
Description: Closure law for ordinal addition. Proposition 8.2 of [TakeutiZaring] p. 57. (Contributed by NM, 5-May-1995.) (Constructive proof by Jim Kingdon, 26-Jul-2019.) |
Ref | Expression |
---|---|
oacl | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ∈ On) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oav 6431 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (rec((𝑧 ∈ V ↦ suc 𝑧), 𝐴)‘𝐵)) | |
2 | id 19 | . . 3 ⊢ (𝐴 ∈ On → 𝐴 ∈ On) | |
3 | vex 2733 | . . . . . . . 8 ⊢ 𝑤 ∈ V | |
4 | suceq 4385 | . . . . . . . . 9 ⊢ (𝑧 = 𝑤 → suc 𝑧 = suc 𝑤) | |
5 | eqid 2170 | . . . . . . . . 9 ⊢ (𝑧 ∈ V ↦ suc 𝑧) = (𝑧 ∈ V ↦ suc 𝑧) | |
6 | 3 | sucex 4481 | . . . . . . . . 9 ⊢ suc 𝑤 ∈ V |
7 | 4, 5, 6 | fvmpt 5571 | . . . . . . . 8 ⊢ (𝑤 ∈ V → ((𝑧 ∈ V ↦ suc 𝑧)‘𝑤) = suc 𝑤) |
8 | 3, 7 | ax-mp 5 | . . . . . . 7 ⊢ ((𝑧 ∈ V ↦ suc 𝑧)‘𝑤) = suc 𝑤 |
9 | 8 | eleq1i 2236 | . . . . . 6 ⊢ (((𝑧 ∈ V ↦ suc 𝑧)‘𝑤) ∈ On ↔ suc 𝑤 ∈ On) |
10 | 9 | ralbii 2476 | . . . . 5 ⊢ (∀𝑤 ∈ On ((𝑧 ∈ V ↦ suc 𝑧)‘𝑤) ∈ On ↔ ∀𝑤 ∈ On suc 𝑤 ∈ On) |
11 | suceloni 4483 | . . . . 5 ⊢ (𝑤 ∈ On → suc 𝑤 ∈ On) | |
12 | 10, 11 | mprgbir 2528 | . . . 4 ⊢ ∀𝑤 ∈ On ((𝑧 ∈ V ↦ suc 𝑧)‘𝑤) ∈ On |
13 | 12 | a1i 9 | . . 3 ⊢ (𝐴 ∈ On → ∀𝑤 ∈ On ((𝑧 ∈ V ↦ suc 𝑧)‘𝑤) ∈ On) |
14 | 2, 13 | rdgon 6363 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (rec((𝑧 ∈ V ↦ suc 𝑧), 𝐴)‘𝐵) ∈ On) |
15 | 1, 14 | eqeltrd 2247 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ∈ On) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1348 ∈ wcel 2141 ∀wral 2448 Vcvv 2730 ↦ cmpt 4048 Oncon0 4346 suc csuc 4348 ‘cfv 5196 (class class class)co 5851 reccrdg 6346 +o coa 6390 |
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-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-coll 4102 ax-sep 4105 ax-pow 4158 ax-pr 4192 ax-un 4416 ax-setind 4519 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-ral 2453 df-rex 2454 df-reu 2455 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-nul 3415 df-pw 3566 df-sn 3587 df-pr 3588 df-op 3590 df-uni 3795 df-iun 3873 df-br 3988 df-opab 4049 df-mpt 4050 df-tr 4086 df-id 4276 df-iord 4349 df-on 4351 df-suc 4354 df-xp 4615 df-rel 4616 df-cnv 4617 df-co 4618 df-dm 4619 df-rn 4620 df-res 4621 df-ima 4622 df-iota 5158 df-fun 5198 df-fn 5199 df-f 5200 df-f1 5201 df-fo 5202 df-f1o 5203 df-fv 5204 df-ov 5854 df-oprab 5855 df-mpo 5856 df-recs 6282 df-irdg 6347 df-oadd 6397 |
This theorem is referenced by: omcl 6438 omv2 6442 |
Copyright terms: Public domain | W3C validator |