Theorem omcan 8506

Description: Left cancellation law for ordinal multiplication. Proposition 8.20 of [TakeutiZaring] p. 63 and its converse. (Contributed by NM, 14-Dec-2004.)

Assertion

Ref	Expression
omcan	⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐴) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ 𝐵 = 𝐶))

Proof of Theorem omcan

Step	Hyp	Ref	Expression
1		omordi 8503	. . . . . . . . 9 ⊢ (((𝐶 ∈ On ∧ 𝐴 ∈ On) ∧ ∅ ∈ 𝐴) → (𝐵 ∈ 𝐶 → (𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶)))
2	1	ex 412	. . . . . . . 8 ⊢ ((𝐶 ∈ On ∧ 𝐴 ∈ On) → (∅ ∈ 𝐴 → (𝐵 ∈ 𝐶 → (𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶))))
3	2	ancoms 458	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐴 → (𝐵 ∈ 𝐶 → (𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶))))
4	3	3adant2 1132	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐴 → (𝐵 ∈ 𝐶 → (𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶))))
5	4	imp 406	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐴) → (𝐵 ∈ 𝐶 → (𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶)))
6		omordi 8503	. . . . . . . . 9 ⊢ (((𝐵 ∈ On ∧ 𝐴 ∈ On) ∧ ∅ ∈ 𝐴) → (𝐶 ∈ 𝐵 → (𝐴 ·o 𝐶) ∈ (𝐴 ·o 𝐵)))
7	6	ex 412	. . . . . . . 8 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (∅ ∈ 𝐴 → (𝐶 ∈ 𝐵 → (𝐴 ·o 𝐶) ∈ (𝐴 ·o 𝐵))))
8	7	ancoms 458	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∅ ∈ 𝐴 → (𝐶 ∈ 𝐵 → (𝐴 ·o 𝐶) ∈ (𝐴 ·o 𝐵))))
9	8	3adant3 1133	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐴 → (𝐶 ∈ 𝐵 → (𝐴 ·o 𝐶) ∈ (𝐴 ·o 𝐵))))
10	9	imp 406	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐴) → (𝐶 ∈ 𝐵 → (𝐴 ·o 𝐶) ∈ (𝐴 ·o 𝐵)))
11	5, 10	orim12d 967	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐴) → ((𝐵 ∈ 𝐶 ∨ 𝐶 ∈ 𝐵) → ((𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶) ∨ (𝐴 ·o 𝐶) ∈ (𝐴 ·o 𝐵))))
12	11	con3d 152	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐴) → (¬ ((𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶) ∨ (𝐴 ·o 𝐶) ∈ (𝐴 ·o 𝐵)) → ¬ (𝐵 ∈ 𝐶 ∨ 𝐶 ∈ 𝐵)))
13		omcl 8473	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) ∈ On)
14		eloni 6335	. . . . . . 7 ⊢ ((𝐴 ·o 𝐵) ∈ On → Ord (𝐴 ·o 𝐵))
15	13, 14	syl 17	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord (𝐴 ·o 𝐵))
16		omcl 8473	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ·o 𝐶) ∈ On)
17		eloni 6335	. . . . . . 7 ⊢ ((𝐴 ·o 𝐶) ∈ On → Ord (𝐴 ·o 𝐶))
18	16, 17	syl 17	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐶 ∈ On) → Ord (𝐴 ·o 𝐶))
19		ordtri3 6361	. . . . . 6 ⊢ ((Ord (𝐴 ·o 𝐵) ∧ Ord (𝐴 ·o 𝐶)) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ ¬ ((𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶) ∨ (𝐴 ·o 𝐶) ∈ (𝐴 ·o 𝐵))))
20	15, 18, 19	syl2an 597	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴 ∈ On ∧ 𝐶 ∈ On)) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ ¬ ((𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶) ∨ (𝐴 ·o 𝐶) ∈ (𝐴 ·o 𝐵))))
21	20	3impdi 1352	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ ¬ ((𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶) ∨ (𝐴 ·o 𝐶) ∈ (𝐴 ·o 𝐵))))
22	21	adantr 480	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐴) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ ¬ ((𝐴 ·o 𝐵) ∈ (𝐴 ·o 𝐶) ∨ (𝐴 ·o 𝐶) ∈ (𝐴 ·o 𝐵))))
23		eloni 6335	. . . . . 6 ⊢ (𝐵 ∈ On → Ord 𝐵)
24		eloni 6335	. . . . . 6 ⊢ (𝐶 ∈ On → Ord 𝐶)
25		ordtri3 6361	. . . . . 6 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 = 𝐶 ↔ ¬ (𝐵 ∈ 𝐶 ∨ 𝐶 ∈ 𝐵)))
26	23, 24, 25	syl2an 597	. . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 = 𝐶 ↔ ¬ (𝐵 ∈ 𝐶 ∨ 𝐶 ∈ 𝐵)))
27	26	3adant1 1131	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 = 𝐶 ↔ ¬ (𝐵 ∈ 𝐶 ∨ 𝐶 ∈ 𝐵)))
28	27	adantr 480	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐴) → (𝐵 = 𝐶 ↔ ¬ (𝐵 ∈ 𝐶 ∨ 𝐶 ∈ 𝐵)))
29	12, 22, 28	3imtr4d 294	. 2 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐴) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) → 𝐵 = 𝐶))
30		oveq2 7376	. 2 ⊢ (𝐵 = 𝐶 → (𝐴 ·o 𝐵) = (𝐴 ·o 𝐶))
31	29, 30	impbid1 225	1 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐴) → ((𝐴 ·o 𝐵) = (𝐴 ·o 𝐶) ↔ 𝐵 = 𝐶))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∅c0 4287  Ord word 6324  Oncon0 6325  (class class class)co 7368   ·_o comu 8405

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 5243  ax-nul 5253  ax-pr 5379  ax-un 7690

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 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-oadd 8411  df-omul 8412

This theorem is referenced by:  omword  8507  fin1a2lem4  10325