Theorem oacl 8365

Description: Closure law for ordinal addition. Proposition 8.2 of [TakeutiZaring] p. 57. (Contributed by NM, 5-May-1995.)

Assertion

Ref	Expression
oacl	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ∈ On)

Proof of Theorem oacl

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7283	. . . 4 ⊢ (𝑥 = ∅ → (𝐴 +o 𝑥) = (𝐴 +o ∅))
2	1	eleq1d 2823	. . 3 ⊢ (𝑥 = ∅ → ((𝐴 +o 𝑥) ∈ On ↔ (𝐴 +o ∅) ∈ On))
3		oveq2 7283	. . . 4 ⊢ (𝑥 = 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o 𝑦))
4	3	eleq1d 2823	. . 3 ⊢ (𝑥 = 𝑦 → ((𝐴 +o 𝑥) ∈ On ↔ (𝐴 +o 𝑦) ∈ On))
5		oveq2 7283	. . . 4 ⊢ (𝑥 = suc 𝑦 → (𝐴 +o 𝑥) = (𝐴 +o suc 𝑦))
6	5	eleq1d 2823	. . 3 ⊢ (𝑥 = suc 𝑦 → ((𝐴 +o 𝑥) ∈ On ↔ (𝐴 +o suc 𝑦) ∈ On))
7		oveq2 7283	. . . 4 ⊢ (𝑥 = 𝐵 → (𝐴 +o 𝑥) = (𝐴 +o 𝐵))
8	7	eleq1d 2823	. . 3 ⊢ (𝑥 = 𝐵 → ((𝐴 +o 𝑥) ∈ On ↔ (𝐴 +o 𝐵) ∈ On))
9		oa0 8346	. . . . 5 ⊢ (𝐴 ∈ On → (𝐴 +o ∅) = 𝐴)
10	9	eleq1d 2823	. . . 4 ⊢ (𝐴 ∈ On → ((𝐴 +o ∅) ∈ On ↔ 𝐴 ∈ On))
11	10	ibir 267	. . 3 ⊢ (𝐴 ∈ On → (𝐴 +o ∅) ∈ On)
12		suceloni 7659	. . . . 5 ⊢ ((𝐴 +o 𝑦) ∈ On → suc (𝐴 +o 𝑦) ∈ On)
13		oasuc 8354	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 +o suc 𝑦) = suc (𝐴 +o 𝑦))
14	13	eleq1d 2823	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝑦 ∈ On) → ((𝐴 +o suc 𝑦) ∈ On ↔ suc (𝐴 +o 𝑦) ∈ On))
15	12, 14	syl5ibr 245	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝑦 ∈ On) → ((𝐴 +o 𝑦) ∈ On → (𝐴 +o suc 𝑦) ∈ On))
16	15	expcom 414	. . 3 ⊢ (𝑦 ∈ On → (𝐴 ∈ On → ((𝐴 +o 𝑦) ∈ On → (𝐴 +o suc 𝑦) ∈ On)))
17		vex 3436	. . . . . 6 ⊢ 𝑥 ∈ V
18		iunon 8170	. . . . . 6 ⊢ ((𝑥 ∈ V ∧ ∀𝑦 ∈ 𝑥 (𝐴 +o 𝑦) ∈ On) → ∪ 𝑦 ∈ 𝑥 (𝐴 +o 𝑦) ∈ On)
19	17, 18	mpan 687	. . . . 5 ⊢ (∀𝑦 ∈ 𝑥 (𝐴 +o 𝑦) ∈ On → ∪ 𝑦 ∈ 𝑥 (𝐴 +o 𝑦) ∈ On)
20		oalim 8362	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ (𝑥 ∈ V ∧ Lim 𝑥)) → (𝐴 +o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐴 +o 𝑦))
21	17, 20	mpanr1 700	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ Lim 𝑥) → (𝐴 +o 𝑥) = ∪ 𝑦 ∈ 𝑥 (𝐴 +o 𝑦))
22	21	eleq1d 2823	. . . . 5 ⊢ ((𝐴 ∈ On ∧ Lim 𝑥) → ((𝐴 +o 𝑥) ∈ On ↔ ∪ 𝑦 ∈ 𝑥 (𝐴 +o 𝑦) ∈ On))
23	19, 22	syl5ibr 245	. . . 4 ⊢ ((𝐴 ∈ On ∧ Lim 𝑥) → (∀𝑦 ∈ 𝑥 (𝐴 +o 𝑦) ∈ On → (𝐴 +o 𝑥) ∈ On))
24	23	expcom 414	. . 3 ⊢ (Lim 𝑥 → (𝐴 ∈ On → (∀𝑦 ∈ 𝑥 (𝐴 +o 𝑦) ∈ On → (𝐴 +o 𝑥) ∈ On)))
25	2, 4, 6, 8, 11, 16, 24	tfinds3 7711	. 2 ⊢ (𝐵 ∈ On → (𝐴 ∈ On → (𝐴 +o 𝐵) ∈ On))
26	25	impcom 408	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ∈ On)

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1539   ∈ wcel 2106  ∀wral 3064  Vcvv 3432  ∅c0 4256  ∪ ciun 4924  Oncon0 6266  Lim wlim 6267  suc csuc 6268  (class class class)co 7275   +_o coa 8294

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-oadd 8301

This theorem is referenced by:  omcl  8366  oaord  8378  oacan  8379  oaword  8380  oawordri  8381  oawordeulem  8385  oalimcl  8391  oaass  8392  oaf1o  8394  odi  8410  omopth2  8415  oeoalem  8427  oeoa  8428  oancom  9409  cantnfvalf  9423  dfac12lem2  9900  djunum  9951  wunex3  10497  rdgeqoa  35541  oa1cl  41054