Theorem oaord 8535

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 8534	. . 3 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 → (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
2	1	3adant1 1131	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 → (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))
3		oveq2 7404	. . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐶 +o 𝐴) = (𝐶 +o 𝐵))
4	3	a1i 11	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 = 𝐵 → (𝐶 +o 𝐴) = (𝐶 +o 𝐵)))
5		oaordi 8534	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ∈ 𝐴 → (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)))
6	5	3adant2 1132	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ∈ 𝐴 → (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)))
7	4, 6	orim12d 964	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴) → ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴))))
8	7	con3d 152	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (¬ ((𝐶 +o 𝐴) = (𝐶 +o 𝐵) ∨ (𝐶 +o 𝐵) ∈ (𝐶 +o 𝐴)) → ¬ (𝐴 = 𝐵 ∨ 𝐵 ∈ 𝐴)))
9		df-3an 1090	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ↔ ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On))
10		ancom 462	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) ↔ (𝐶 ∈ On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On)))
11		anandi 675	. . . . . 6 ⊢ ((𝐶 ∈ On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On)) ↔ ((𝐶 ∈ On ∧ 𝐴 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐵 ∈ On)))
12	9, 10, 11	3bitri 297	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ↔ ((𝐶 ∈ On ∧ 𝐴 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐵 ∈ On)))
13		oacl 8522	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On) → (𝐶 +o 𝐴) ∈ On)
14		eloni 6366	. . . . . . 7 ⊢ ((𝐶 +o 𝐴) ∈ On → Ord (𝐶 +o 𝐴))
15	13, 14	syl 17	. . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On) → Ord (𝐶 +o 𝐴))
16		oacl 8522	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐵 ∈ On) → (𝐶 +o 𝐵) ∈ On)
17		eloni 6366	. . . . . . 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 216	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (Ord (𝐶 +o 𝐴) ∧ Ord (𝐶 +o 𝐵)))
21		ordtri2 6391	. . . 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 6366	. . . . . 6 ⊢ (𝐴 ∈ On → Ord 𝐴)
24		eloni 6366	. . . . . 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 6391	. . . 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 211	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 ↔ (𝐶 +o 𝐴) ∈ (𝐶 +o 𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 397   ∨ wo 846   ∧ w3a 1088   = wceq 1542   ∈ wcel 2107  Ord word 6355  Oncon0 6356  (class class class)co 7396   +_o coa 8450

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 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5281  ax-sep 5295  ax-nul 5302  ax-pr 5423  ax-un 7712

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3776  df-csb 3892  df-dif 3949  df-un 3951  df-in 3953  df-ss 3963  df-pss 3965  df-nul 4321  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4905  df-iun 4995  df-br 5145  df-opab 5207  df-mpt 5228  df-tr 5262  df-id 5570  df-eprel 5576  df-po 5584  df-so 5585  df-fr 5627  df-we 5629  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-pred 6292  df-ord 6359  df-on 6360  df-lim 6361  df-suc 6362  df-iota 6487  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7843  df-2nd 7963  df-frecs 8253  df-wrecs 8284  df-recs 8358  df-rdg 8397  df-oadd 8457

This theorem is referenced by:  oacan  8536  oaword  8537  oaord1  8539  oa00  8547  oalimcl  8548  oaass  8549  odi  8567  oneo  8569  omeulem1  8570  omeulem2  8571  oeeui  8590  omxpenlem  9061  cantnflt  9654  cantnflem1d  9670  cantnflem1  9671  oaord3  41913  oawordex2  41947