ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  oacl GIF version

Theorem oacl 6737
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.)
Assertion
Ref Expression
oacl ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ∈ On)

Proof of Theorem oacl
Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oav 6731 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (rec((𝑧 ∈ V ↦ suc 𝑧), 𝐴)‘𝐵))
2 id 19 . . 3 (𝐴 ∈ On → 𝐴 ∈ On)
3 vex 2824 . . . . . . . 8 𝑤 ∈ V
4 suceq 4549 . . . . . . . . 9 (𝑧 = 𝑤 → suc 𝑧 = suc 𝑤)
5 eqid 2238 . . . . . . . . 9 (𝑧 ∈ V ↦ suc 𝑧) = (𝑧 ∈ V ↦ suc 𝑧)
63sucex 4648 . . . . . . . . 9 suc 𝑤 ∈ V
74, 5, 6fvmpt 5785 . . . . . . . 8 (𝑤 ∈ V → ((𝑧 ∈ V ↦ suc 𝑧)‘𝑤) = suc 𝑤)
83, 7ax-mp 5 . . . . . . 7 ((𝑧 ∈ V ↦ suc 𝑧)‘𝑤) = suc 𝑤
98eleq1i 2304 . . . . . 6 (((𝑧 ∈ V ↦ suc 𝑧)‘𝑤) ∈ On ↔ suc 𝑤 ∈ On)
109ralbii 2556 . . . . 5 (∀𝑤 ∈ On ((𝑧 ∈ V ↦ suc 𝑧)‘𝑤) ∈ On ↔ ∀𝑤 ∈ On suc 𝑤 ∈ On)
11 onsuc 4650 . . . . 5 (𝑤 ∈ On → suc 𝑤 ∈ On)
1210, 11mprgbir 2608 . . . 4 ∀𝑤 ∈ On ((𝑧 ∈ V ↦ suc 𝑧)‘𝑤) ∈ On
1312a1i 9 . . 3 (𝐴 ∈ On → ∀𝑤 ∈ On ((𝑧 ∈ V ↦ suc 𝑧)‘𝑤) ∈ On)
142, 13rdgon 6661 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (rec((𝑧 ∈ V ↦ suc 𝑧), 𝐴)‘𝐵) ∈ On)
151, 14eqeltrd 2315 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ∈ On)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   ↦ cmpt 4193  Oncon0 4510  suc csuc 4512  ‘cfv 5380  (class class class)co 6088  reccrdg 6644   +o coa 6688
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-recs 6580  df-irdg 6645  df-oadd 6695
This theorem is used by:  omcl  6738  omv2  6742
  Copyright terms: Public domain W3C validator