Theorem oaord 8340

Description: Ordering property of ordinal addition. Proposition 8.4 of [TakeutiZaring] p. 58 and its converse. (Contributed by NM, 5-Dec-2004.)

Assertion

Ref	Expression
oaord	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 ↔ (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))

Proof of Theorem oaord

Step	Hyp	Ref	Expression
1		oaordi 8339	. . 3 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 → (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
2	1	3adant1 1128	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 → (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
3		oveq2 7263	. . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐶 +o 𝐴) = (𝐶 +o 𝐵))
4	3	a1i 11	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 = 𝐵 → (𝐶 +o 𝐴) = (𝐶 +o 𝐵)))
5		oaordi 8339	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ∈ 𝐴 → (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)))
6	5	3adant2 1129	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ∈ 𝐴 → (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)))
7	4, 6	orim12d 961	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) → ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴))))
8	7	con3d 152	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (¬ ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)) → ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
9		df-3an 1087	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ↔ ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On))
10		ancom 460	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) ↔ (𝐶 ∈ On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On)))
11		anandi 672	. . . . . 6 ⊢ ((𝐶 ∈ On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On)) ↔ ((𝐶 ∈ On ∧ 𝐴 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐵 ∈ On)))
12	9, 10, 11	3bitri 296	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ↔ ((𝐶 ∈ On ∧ 𝐴 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐵 ∈ On)))
13		oacl 8327	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On) → (𝐶 +o 𝐴) ∈ On)
14		eloni 6261	. . . . . . 7 ⊢ ((𝐶 +o 𝐴) ∈ On → Ord (𝐶 +o 𝐴))
15	13, 14	syl 17	. . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On) → Ord (𝐶 +o 𝐴))
16		oacl 8327	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐵 ∈ On) → (𝐶 +o 𝐵) ∈ On)
17		eloni 6261	. . . . . . 7 ⊢ ((𝐶 +o 𝐵) ∈ On → Ord (𝐶 +o 𝐵))
18	16, 17	syl 17	. . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐵 ∈ On) → Ord (𝐶 +o 𝐵))
19	15, 18	anim12i 612	. . . . 5 ⊢ (((𝐶 ∈ On ∧ 𝐴 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐵 ∈ On)) → (Ord (𝐶 +o 𝐴) ∧ Ord (𝐶 +o 𝐵)))
20	12, 19	sylbi 216	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (Ord (𝐶 +o 𝐴) ∧ Ord (𝐶 +o 𝐵)))
21		ordtri2 6286	. . . 4 ⊢ ((Ord (𝐶 +o 𝐴) ∧ Ord (𝐶 +o 𝐵)) → ((𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵) ↔ ¬ ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴))))
22	20, 21	syl 17	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵) ↔ ¬ ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴))))
23		eloni 6261	. . . . . 6 ⊢ (𝐴 ∈ On → Ord 𝐴)
24		eloni 6261	. . . . . 6 ⊢ (𝐵 ∈ On → Ord 𝐵)
25	23, 24	anim12i 612	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (Ord 𝐴 ∧ Ord 𝐵))
26	25	3adant3 1130	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (Ord 𝐴 ∧ Ord 𝐵))
27		ordtri2 6286	. . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
28	26, 27	syl 17	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
29	8, 22, 28	3imtr4d 293	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵) → 𝐴 ∈ 𝐵))
30	2, 29	impbid 211	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 ↔ (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 843   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  Ord word 6250  Oncon0 6251  (class class class)co 7255   +_o coa 8264

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-oadd 8271

This theorem is referenced by:  oacan  8341  oaword  8342  oaord1  8344  oa00  8352  oalimcl  8353  oaass  8354  odi  8372  oneo  8374  omeulem1  8375  omeulem2  8376  oeeui  8395  omxpenlem  8813  cantnflt  9360  cantnflem1d  9376  cantnflem1  9377