Theorem oaord 8486

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 8485	. . 3 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 → (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
2	1	3adant1 1131	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 → (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
3		oveq2 7378	. . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐶 +o 𝐴) = (𝐶 +o 𝐵))
4	3	a1i 11	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 = 𝐵 → (𝐶 +o 𝐴) = (𝐶 +o 𝐵)))
5		oaordi 8485	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ∈ 𝐴 → (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)))
6	5	3adant2 1132	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ∈ 𝐴 → (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)))
7	4, 6	orim12d 967	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) → ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴))))
8	7	con3d 152	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (¬ ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)) → ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
9		df-3an 1089	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ↔ ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On))
10		ancom 460	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) ↔ (𝐶 ∈ On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On)))
11		anandi 677	. . . . . 6 ⊢ ((𝐶 ∈ On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On)) ↔ ((𝐶 ∈ On ∧ 𝐴 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐵 ∈ On)))
12	9, 10, 11	3bitri 297	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ↔ ((𝐶 ∈ On ∧ 𝐴 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐵 ∈ On)))
13		oacl 8474	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On) → (𝐶 +o 𝐴) ∈ On)
14		eloni 6337	. . . . . . 7 ⊢ ((𝐶 +o 𝐴) ∈ On → Ord (𝐶 +o 𝐴))
15	13, 14	syl 17	. . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On) → Ord (𝐶 +o 𝐴))
16		oacl 8474	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐵 ∈ On) → (𝐶 +o 𝐵) ∈ On)
17		eloni 6337	. . . . . . 7 ⊢ ((𝐶 +o 𝐵) ∈ On → Ord (𝐶 +o 𝐵))
18	16, 17	syl 17	. . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐵 ∈ On) → Ord (𝐶 +o 𝐵))
19	15, 18	anim12i 614	. . . . 5 ⊢ (((𝐶 ∈ On ∧ 𝐴 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐵 ∈ On)) → (Ord (𝐶 +o 𝐴) ∧ Ord (𝐶 +o 𝐵)))
20	12, 19	sylbi 217	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (Ord (𝐶 +o 𝐴) ∧ Ord (𝐶 +o 𝐵)))
21		ordtri2 6362	. . . 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 6337	. . . . . 6 ⊢ (𝐴 ∈ On → Ord 𝐴)
24		eloni 6337	. . . . . 6 ⊢ (𝐵 ∈ On → Ord 𝐵)
25	23, 24	anim12i 614	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (Ord 𝐴 ∧ Ord 𝐵))
26	25	3adant3 1133	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (Ord 𝐴 ∧ Ord 𝐵))
27		ordtri2 6362	. . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
28	26, 27	syl 17	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
29	8, 22, 28	3imtr4d 294	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵) → 𝐴 ∈ 𝐵))
30	2, 29	impbid 212	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 ↔ (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  Ord word 6326  Oncon0 6327  (class class class)co 7370   +_o coa 8406

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 5226  ax-sep 5245  ax-nul 5255  ax-pr 5381  ax-un 7692

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 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-pred 6269  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-ov 7373  df-oprab 7374  df-mpo 7375  df-om 7821  df-2nd 7946  df-frecs 8235  df-wrecs 8266  df-recs 8315  df-rdg 8353  df-oadd 8413

This theorem is referenced by:  oacan  8487  oaword  8488  oaord1  8490  oa00  8498  oalimcl  8499  oaass  8500  odi  8518  oneo  8520  omeulem1  8521  omeulem2  8522  oeeui  8542  omxpenlem  9020  cantnflt  9595  cantnflem1d  9611  cantnflem1  9612  oaord3  43678  oawordex2  43712