Theorem oewordi 8614

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 6379	. . . . . 6 ⊢ (𝐶 ∈ On → Ord 𝐶)
2		ordgt0ge1 8515	. . . . . 6 ⊢ (Ord 𝐶 → (∅ ∈ 𝐶 ↔ 1o ⊆ 𝐶))
3	1, 2	syl 18	. . . . 5 ⊢ (𝐶 ∈ On → (∅ ∈ 𝐶 ↔ 1o ⊆ 𝐶))
4		1on 8503	. . . . . 6 ⊢ 1o ∈ On
5		onsseleq 6411	. . . . . 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 8524	. . . . . . 7 ⊢ (𝐶 ∈ (On ∖ 2o) ↔ (𝐶 ∈ On ∧ 1o ∈ 𝐶))
10		oeword 8613	. . . . . . . . 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 8567	. . . . . . . . . 10 ⊢ (𝐴 ∈ On → (1o ↑o 𝐴) = 1o)
17	16	adantr 486	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ↑o 𝐴) = 1o)
18		oe1m 8567	. . . . . . . . . 10 ⊢ (𝐵 ∈ On → (1o ↑o 𝐵) = 1o)
19	18	adantl 487	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ↑o 𝐵) = 1o)
20	17, 19	eqtr4d 2801	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ↑o 𝐴) = (1o ↑o 𝐵))
21		eqimss 3971	. . . . . . . 8 ⊢ ((1o ↑o 𝐴) = (1o ↑o 𝐵) → (1o ↑o 𝐴) ⊆ (1o ↑o 𝐵))
22	20, 21	syl 18	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ↑o 𝐴) ⊆ (1o ↑o 𝐵))
23		oveq1 7437	. . . . . . . 8 ⊢ (1o = 𝐶 → (1o ↑o 𝐴) = (𝐶 ↑o 𝐴))
24		oveq1 7437	. . . . . . . 8 ⊢ (1o = 𝐶 → (1o ↑o 𝐵) = (𝐶 ↑o 𝐵))
25	23, 24	sseq12d 3946	. . . . . . 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 1569   ∈ wcel 2146   ⊆ wss 3900   ∖ cdif 4048  ∅c0 4281  Ord word 6368  Oncon0 6369  (class class class)co 7430  1_oc1o 8483  2_oc2o 8484   ↑_o coe 8489

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7761

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6311  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7888  df-2nd 8012  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432  df-1o 8490  df-2o 8491  df-oadd 8494  df-omul 8495  df-oexp 8496

This theorem is used by:  oelim2  8618  oeoalem  8619  oeoelem  8621  oaabs2  8672  cantnflt  9686  cnfcom  9714  oege1  44454  cantnf2  44473  omabs2  44480  omltoe  44554