Theorem oewordi 8600

Description: Weak ordering property of ordinal exponentiation. Lemma 3.19 of [Schloeder] p. 10. (Contributed by NM, 6-Jan-2005.)

Assertion

Ref	Expression
oewordi	⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴 ⊆ 𝐵 → (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵)))

Proof of Theorem oewordi

Step	Hyp	Ref	Expression
1		eloni 6372	. . . . . 6 ⊢ (𝐶 ∈ On → Ord 𝐶)
2		ordgt0ge1 8501	. . . . . 6 ⊢ (Ord 𝐶 → (∅ ∈ 𝐶 ↔ 1o ⊆ 𝐶))
3	1, 2	syl 18	. . . . 5 ⊢ (𝐶 ∈ On → (∅ ∈ 𝐶 ↔ 1o ⊆ 𝐶))
4		1on 8489	. . . . . 6 ⊢ 1o ∈ On
5		onsseleq 6404	. . . . . 6 ⊢ ((1o ∈ On ∧ 𝐶 ∈ On) → (1o ⊆ 𝐶 ↔ (1o ∈ 𝐶 ∨ 1o = 𝐶)))
6	4, 5	mpan 703	. . . . 5 ⊢ (𝐶 ∈ On → (1o ⊆ 𝐶 ↔ (1o ∈ 𝐶 ∨ 1o = 𝐶)))
7	3, 6	bitrd 282	. . . 4 ⊢ (𝐶 ∈ On → (∅ ∈ 𝐶 ↔ (1o ∈ 𝐶 ∨ 1o = 𝐶)))
8	7	3ad2ant3 1153	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐶 ↔ (1o ∈ 𝐶 ∨ 1o = 𝐶)))
9		ondif2 8510	. . . . . . 7 ⊢ (𝐶 ∈ (On ∖ 2o) ↔ (𝐶 ∈ On ∧ 1o ∈ 𝐶))
10		oeword 8599	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ⊆ 𝐵 ↔ (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵)))
11	10	biimpd 232	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ (On ∖ 2o)) → (𝐴 ⊆ 𝐵 → (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵)))
12	11	3expia 1139	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ∈ (On ∖ 2o) → (𝐴 ⊆ 𝐵 → (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵))))
13	9, 12	biimtrrid 246	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐶 ∈ On ∧ 1o ∈ 𝐶) → (𝐴 ⊆ 𝐵 → (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵))))
14	13	expd 421	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ∈ On → (1o ∈ 𝐶 → (𝐴 ⊆ 𝐵 → (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵)))))
15	14	3impia 1135	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (1o ∈ 𝐶 → (𝐴 ⊆ 𝐵 → (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵))))
16		oe1m 8553	. . . . . . . . . 10 ⊢ (𝐴 ∈ On → (1o ↑o 𝐴) = 1o)
17	16	adantr 486	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ↑o 𝐴) = 1o)
18		oe1m 8553	. . . . . . . . . 10 ⊢ (𝐵 ∈ On → (1o ↑o 𝐵) = 1o)
19	18	adantl 487	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ↑o 𝐵) = 1o)
20	17, 19	eqtr4d 2799	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ↑o 𝐴) = (1o ↑o 𝐵))
21		eqimss 3989	. . . . . . . 8 ⊢ ((1o ↑o 𝐴) = (1o ↑o 𝐵) → (1o ↑o 𝐴) ⊆ (1o ↑o 𝐵))
22	20, 21	syl 18	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ↑o 𝐴) ⊆ (1o ↑o 𝐵))
23		oveq1 7427	. . . . . . . 8 ⊢ (1o = 𝐶 → (1o ↑o 𝐴) = (𝐶 ↑o 𝐴))
24		oveq1 7427	. . . . . . . 8 ⊢ (1o = 𝐶 → (1o ↑o 𝐵) = (𝐶 ↑o 𝐵))
25	23, 24	sseq12d 3964	. . . . . . 7 ⊢ (1o = 𝐶 → ((1o ↑o 𝐴) ⊆ (1o ↑o 𝐵) ↔ (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵)))
26	22, 25	syl5ibcom 248	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o = 𝐶 → (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵)))
27	26	3adant3 1150	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (1o = 𝐶 → (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵)))
28	27	a1dd 51	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (1o = 𝐶 → (𝐴 ⊆ 𝐵 → (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵))))
29	15, 28	jaod 873	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((1o ∈ 𝐶 ∨ 1o = 𝐶) → (𝐴 ⊆ 𝐵 → (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵))))
30	8, 29	sylbid 243	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (∅ ∈ 𝐶 → (𝐴 ⊆ 𝐵 → (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵))))
31	30	imp 412	1 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ ∅ ∈ 𝐶) → (𝐴 ⊆ 𝐵 → (𝐶 ↑o 𝐴) ⊆ (𝐶 ↑o 𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ∖ cdif 3896   ⊆ wss 3899  ∅c0 4279  Ord word 6361  Oncon0 6362  (class class class)co 7420  1_oc1o 8469  2_oc2o 8470   ↑_o coe 8475

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-2o 8477  df-oadd 8480  df-omul 8481  df-oexp 8482

This theorem is used by:  oelim2  8604  oeoalem  8605  oeoelem  8607  oaabs2  8658  cantnflt  9673  cnfcom  9701  oege1  44307  cantnf2  44326  omabs2  44333  omltoe  44407