Theorem hsmexlem1 10431

Description: Lemma for hsmex 10437. Bound the order type of a limited-cardinality set of ordinals. (Contributed by Stefan O'Rear, 14-Feb-2015.) (Revised by Mario Carneiro, 26-Jun-2015.)

Hypothesis

Ref	Expression
hsmexlem.o	⊢ 𝑂 = OrdIso( E , 𝐴)

Assertion

Ref	Expression
hsmexlem1	⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ∈ (har‘𝒫 𝐵))

Proof of Theorem hsmexlem1

Step	Hyp	Ref	Expression
1		hsmexlem.o	. . . 4 ⊢ 𝑂 = OrdIso( E , 𝐴)
2	1	oicl 9504	. . 3 ⊢ Ord dom 𝑂
3		relwdom 9541	. . . . . . . 8 ⊢ Rel ≼*
4	3	brrelex1i 5711	. . . . . . 7 ⊢ (𝐴 ≼* 𝐵 → 𝐴 ∈ V)
5	4	adantl 487	. . . . . 6 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝐴 ∈ V)
6		uniexg 7743	. . . . . 6 ⊢ (𝐴 ∈ V → ∪ 𝐴 ∈ V)
7		sucexg 7805	. . . . . 6 ⊢ (∪ 𝐴 ∈ V → suc ∪ 𝐴 ∈ V)
8	5, 6, 7	3syl 19	. . . . 5 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → suc ∪ 𝐴 ∈ V)
9	1	oif 9505	. . . . . . 7 ⊢ 𝑂:dom 𝑂⟶𝐴
10		onsucuni 7825	. . . . . . . 8 ⊢ (𝐴 ⊆ On → 𝐴 ⊆ suc ∪ 𝐴)
11	10	adantr 486	. . . . . . 7 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝐴 ⊆ suc ∪ 𝐴)
12		fss 6720	. . . . . . 7 ⊢ ((𝑂:dom 𝑂⟶𝐴 ∧ 𝐴 ⊆ suc ∪ 𝐴) → 𝑂:dom 𝑂⟶suc ∪ 𝐴)
13	9, 11, 12	sylancr 599	. . . . . 6 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝑂:dom 𝑂⟶suc ∪ 𝐴)
14	1	oismo 9515	. . . . . . . 8 ⊢ (𝐴 ⊆ On → (Smo 𝑂 ∧ ran 𝑂 = 𝐴))
15	14	adantr 486	. . . . . . 7 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → (Smo 𝑂 ∧ ran 𝑂 = 𝐴))
16	15	simpld 500	. . . . . 6 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → Smo 𝑂)
17		ssorduni 7779	. . . . . . . 8 ⊢ (𝐴 ⊆ On → Ord ∪ 𝐴)
18	17	adantr 486	. . . . . . 7 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → Ord ∪ 𝐴)
19		ordsuc 7811	. . . . . . 7 ⊢ (Ord ∪ 𝐴 ↔ Ord suc ∪ 𝐴)
20	18, 19	sylib 221	. . . . . 6 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → Ord suc ∪ 𝐴)
21		smocdmdom 8358	. . . . . 6 ⊢ ((𝑂:dom 𝑂⟶suc ∪ 𝐴 ∧ Smo 𝑂 ∧ Ord suc ∪ 𝐴) → dom 𝑂 ⊆ suc ∪ 𝐴)
22	13, 16, 20, 21	syl3anc 1398	. . . . 5 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ⊆ suc ∪ 𝐴)
23	8, 22	ssexd 5289	. . . 4 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ∈ V)
24		elong 6365	. . . 4 ⊢ (dom 𝑂 ∈ V → (dom 𝑂 ∈ On ↔ Ord dom 𝑂))
25	23, 24	syl 18	. . 3 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → (dom 𝑂 ∈ On ↔ Ord dom 𝑂))
26	2, 25	mpbiri 261	. 2 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ∈ On)
27		canth2g 9132	. . . 4 ⊢ (dom 𝑂 ∈ V → dom 𝑂 ≺ 𝒫 dom 𝑂)
28		sdomdom 8989	. . . 4 ⊢ (dom 𝑂 ≺ 𝒫 dom 𝑂 → dom 𝑂 ≼ 𝒫 dom 𝑂)
29	23, 27, 28	3syl 19	. . 3 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼ 𝒫 dom 𝑂)
30		simpl 488	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝐴 ⊆ On)
31		epweon 7775	. . . . . . . . . . 11 ⊢ E We On
32		wess 5641	. . . . . . . . . . 11 ⊢ (𝐴 ⊆ On → ( E We On → E We 𝐴))
33	30, 31, 32	mpisyl 22	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → E We 𝐴)
34		epse 5637	. . . . . . . . . 10 ⊢ E Se 𝐴
35	1	oiiso2 9506	. . . . . . . . . 10 ⊢ (( E We 𝐴 ∧ E Se 𝐴) → 𝑂 Isom E , E (dom 𝑂, ran 𝑂))
36	33, 34, 35	sylancl 598	. . . . . . . . 9 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝑂 Isom E , E (dom 𝑂, ran 𝑂))
37		isof1o 7325	. . . . . . . . 9 ⊢ (𝑂 Isom E , E (dom 𝑂, ran 𝑂) → 𝑂:dom 𝑂–1-1-onto→ran 𝑂)
38	36, 37	syl 18	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝑂:dom 𝑂–1-1-onto→ran 𝑂)
39	15	simprd 501	. . . . . . . . 9 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → ran 𝑂 = 𝐴)
40	39	f1oeq3d 6815	. . . . . . . 8 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → (𝑂:dom 𝑂–1-1-onto→ran 𝑂 ↔ 𝑂:dom 𝑂–1-1-onto→𝐴))
41	38, 40	mpbid 235	. . . . . . 7 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝑂:dom 𝑂–1-1-onto→𝐴)
42		f1oen2g 8977	. . . . . . 7 ⊢ ((dom 𝑂 ∈ On ∧ 𝐴 ∈ V ∧ 𝑂:dom 𝑂–1-1-onto→𝐴) → dom 𝑂 ≈ 𝐴)
43	26, 5, 41, 42	syl3anc 1398	. . . . . 6 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≈ 𝐴)
44		endom 8988	. . . . . 6 ⊢ (dom 𝑂 ≈ 𝐴 → dom 𝑂 ≼ 𝐴)
45		domwdom 9549	. . . . . 6 ⊢ (dom 𝑂 ≼ 𝐴 → dom 𝑂 ≼* 𝐴)
46	43, 44, 45	3syl 19	. . . . 5 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼* 𝐴)
47		wdomtr 9550	. . . . 5 ⊢ ((dom 𝑂 ≼* 𝐴 ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼* 𝐵)
48	46, 47	sylancom 600	. . . 4 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼* 𝐵)
49		wdompwdom 9553	. . . 4 ⊢ (dom 𝑂 ≼* 𝐵 → 𝒫 dom 𝑂 ≼ 𝒫 𝐵)
50	48, 49	syl 18	. . 3 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝒫 dom 𝑂 ≼ 𝒫 𝐵)
51		domtr 9016	. . 3 ⊢ ((dom 𝑂 ≼ 𝒫 dom 𝑂 ∧ 𝒫 dom 𝑂 ≼ 𝒫 𝐵) → dom 𝑂 ≼ 𝒫 𝐵)
52	29, 50, 51	syl2anc 596	. 2 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼ 𝒫 𝐵)
53		elharval 9536	. 2 ⊢ (dom 𝑂 ∈ (har‘𝒫 𝐵) ↔ (dom 𝑂 ∈ On ∧ dom 𝑂 ≼ 𝒫 𝐵))
54	26, 52, 53	sylanbrc 595	1 ⊢ ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ∈ (har‘𝒫 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867   class class class wbr 5103   E cep 5554   Se wse 5606   We wwe 5607  dom cdm 5655  ran crn 5656  Ord word 6356  Oncon0 6357  suc csuc 6359  ⟶wf 6529  –1-1-onto→wf1o 6532  ‘cfv 6533   Isom wiso 6534  Smo wsmo 8335   ≈ cen 8952   ≼ cdom 8953   ≺ csdm 8954  OrdIsocoi 9484  harchar 9531   ≼^* cwdom 9539

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  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 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  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 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-isom 6542  df-riota 7371  df-ov 7417  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-smo 8336  df-recs 8361  df-en 8956  df-dom 8957  df-sdom 8958  df-oi 9485  df-har 9532  df-wdom 9540

This theorem is used by:  hsmexlem2  10432  hsmexlem4  10434