Theorem oewordi 8583

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 6374	. . . . . 6 ⊢ (𝐶 ∈ On → Ord 𝐶)
2		ordgt0ge1 8484	. . . . . 6 ⊢ (Ord 𝐶 → (∅ ∈ 𝐶 ↔ 1o ⊆ 𝐶))
3	1, 2	syl 18	. . . . 5 ⊢ (𝐶 ∈ On → (∅ ∈ 𝐶 ↔ 1o ⊆ 𝐶))
4		1on 8472	. . . . . 6 ⊢ 1o ∈ On
5		onsseleq 6406	. . . . . 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 8493	. . . . . . 7 ⊢ (𝐶 ∈ (On ∖ 2o) ↔ (𝐶 ∈ On ∧ 1o ∈ 𝐶))
10		oeword 8582	. . . . . . . . 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 8536	. . . . . . . . . 10 ⊢ (𝐴 ∈ On → (1o ↑o 𝐴) = 1o)
17	16	adantr 486	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ↑o 𝐴) = 1o)
18		oe1m 8536	. . . . . . . . . 10 ⊢ (𝐵 ∈ On → (1o ↑o 𝐵) = 1o)
19	18	adantl 487	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ↑o 𝐵) = 1o)
20	17, 19	eqtr4d 2803	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ↑o 𝐴) = (1o ↑o 𝐵))
21		eqimss 3996	. . . . . . . 8 ⊢ ((1o ↑o 𝐴) = (1o ↑o 𝐵) → (1o ↑o 𝐴) ⊆ (1o ↑o 𝐵))
22	20, 21	syl 18	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (1o ↑o 𝐴) ⊆ (1o ↑o 𝐵))
23		oveq1 7426	. . . . . . . 8 ⊢ (1o = 𝐶 → (1o ↑o 𝐴) = (𝐶 ↑o 𝐴))
24		oveq1 7426	. . . . . . . 8 ⊢ (1o = 𝐶 → (1o ↑o 𝐵) = (𝐶 ↑o 𝐵))
25	23, 24	sseq12d 3971	. . . . . . 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 2146   ∖ cdif 3903   ⊆ wss 3906  ∅c0 4286  Ord word 6363  Oncon0 6364  (class class class)co 7419  1_oc1o 8452  2_oc2o 8453   ↑_o coe 8458

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-oadd 8463  df-omul 8464  df-oexp 8465

This theorem is used by:  oelim2  8587  oeoalem  8588  oeoelem  8590  oaabs2  8641  cantnflt  9648  cnfcom  9676  oege1  44110  cantnf2  44129  omabs2  44136  omltoe  44210