MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  hsmexlem1 Structured version   Visualization version   GIF version

Theorem hsmexlem1 10504
Description: Lemma for hsmex 10510. 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
StepHypRef Expression
1 hsmexlem.o . . . 4 𝑂 = OrdIso( E , 𝐴)
21oicl 9523 . . 3 Ord dom 𝑂
3 relwdom 9560 . . . . . . . 8 Rel ≼*
43brrelex1i 5707 . . . . . . 7 (𝐴 ≼* 𝐵 → 𝐴 ∈ V)
54adantl 487 . . . . . 6 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝐴 ∈ V)
6 uniexg 7757 . . . . . 6 (𝐴 ∈ V → ∪ 𝐴 ∈ V)
7 sucexg 7819 . . . . . 6 (∪ 𝐴 ∈ V → suc ∪ 𝐴 ∈ V)
85, 6, 73syl 19 . . . . 5 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → suc ∪ 𝐴 ∈ V)
91oif 9524 . . . . . . 7 𝑂:dom 𝑂⟶𝐴
10 onsucuni 7839 . . . . . . . 8 (𝐴 ⊆ On → 𝐴 ⊆ suc ∪ 𝐴)
1110adantr 486 . . . . . . 7 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝐴 ⊆ suc ∪ 𝐴)
12 fss 6726 . . . . . . 7 ((𝑂:dom 𝑂⟶𝐴 ∧ 𝐴 ⊆ suc ∪ 𝐴) → 𝑂:dom 𝑂⟶suc ∪ 𝐴)
139, 11, 12sylancr 599 . . . . . 6 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝑂:dom 𝑂⟶suc ∪ 𝐴)
141oismo 9534 . . . . . . . 8 (𝐴 ⊆ On → (Smo 𝑂 ∧ ran 𝑂 = 𝐴))
1514adantr 486 . . . . . . 7 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → (Smo 𝑂 ∧ ran 𝑂 = 𝐴))
1615simpld 500 . . . . . 6 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → Smo 𝑂)
17 ssorduni 7793 . . . . . . . 8 (𝐴 ⊆ On → Ord ∪ 𝐴)
1817adantr 486 . . . . . . 7 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → Ord ∪ 𝐴)
19 ordsuc 7825 . . . . . . 7 (Ord ∪ 𝐴 ↔ Ord suc ∪ 𝐴)
2018, 19sylib 221 . . . . . 6 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → Ord suc ∪ 𝐴)
21 smocdmdom 8376 . . . . . 6 ((𝑂:dom 𝑂⟶suc ∪ 𝐴 ∧ Smo 𝑂 ∧ Ord suc ∪ 𝐴) → dom 𝑂 ⊆ suc ∪ 𝐴)
2213, 16, 20, 21syl3anc 1398 . . . . 5 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ⊆ suc ∪ 𝐴)
238, 22ssexd 5286 . . . 4 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ∈ V)
24 elong 6370 . . . 4 (dom 𝑂 ∈ V → (dom 𝑂 ∈ On ↔ Ord dom 𝑂))
2523, 24syl 18 . . 3 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → (dom 𝑂 ∈ On ↔ Ord dom 𝑂))
262, 25mpbiri 261 . 2 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ∈ On)
27 canth2g 9150 . . . 4 (dom 𝑂 ∈ V → dom 𝑂 ≺ 𝒫 dom 𝑂)
28 sdomdom 9007 . . . 4 (dom 𝑂 ≺ 𝒫 dom 𝑂 → dom 𝑂 ≼ 𝒫 dom 𝑂)
2923, 27, 283syl 19 . . 3 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼ 𝒫 dom 𝑂)
30 simpl 488 . . . . . . . . . . 11 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝐴 ⊆ On)
31 epweon 7789 . . . . . . . . . . 11 E We On
32 wess 5637 . . . . . . . . . . 11 (𝐴 ⊆ On → ( E We On → E We 𝐴))
3330, 31, 32mpisyl 22 . . . . . . . . . 10 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → E We 𝐴)
34 epse 5633 . . . . . . . . . 10 E Se 𝐴
351oiiso2 9525 . . . . . . . . . 10 (( E We 𝐴 ∧ E Se 𝐴) → 𝑂 Isom E , E (dom 𝑂, ran 𝑂))
3633, 34, 35sylancl 598 . . . . . . . . 9 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝑂 Isom E , E (dom 𝑂, ran 𝑂))
37 isof1o 7331 . . . . . . . . 9 (𝑂 Isom E , E (dom 𝑂, ran 𝑂) → 𝑂:dom 𝑂–1-1-onto→ran 𝑂)
3836, 37syl 18 . . . . . . . 8 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝑂:dom 𝑂–1-1-onto→ran 𝑂)
3915simprd 501 . . . . . . . . 9 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → ran 𝑂 = 𝐴)
4039f1oeq3d 6821 . . . . . . . 8 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → (𝑂:dom 𝑂–1-1-onto→ran 𝑂 ↔ 𝑂:dom 𝑂–1-1-onto→𝐴))
4138, 40mpbid 235 . . . . . . 7 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝑂:dom 𝑂–1-1-onto→𝐴)
42 f1oen2g 8995 . . . . . . 7 ((dom 𝑂 ∈ On ∧ 𝐴 ∈ V ∧ 𝑂:dom 𝑂–1-1-onto→𝐴) → dom 𝑂 ≈ 𝐴)
4326, 5, 41, 42syl3anc 1398 . . . . . 6 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≈ 𝐴)
44 endom 9006 . . . . . 6 (dom 𝑂 ≈ 𝐴 → dom 𝑂 ≼ 𝐴)
45 domwdom 9568 . . . . . 6 (dom 𝑂 ≼ 𝐴 → dom 𝑂 ≼* 𝐴)
4643, 44, 453syl 19 . . . . 5 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼* 𝐴)
47 wdomtr 9569 . . . . 5 ((dom 𝑂 ≼* 𝐴 ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼* 𝐵)
4846, 47sylancom 600 . . . 4 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼* 𝐵)
49 wdompwdom 9572 . . . 4 (dom 𝑂 ≼* 𝐵 → 𝒫 dom 𝑂 ≼ 𝒫 𝐵)
5048, 49syl 18 . . 3 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝒫 dom 𝑂 ≼ 𝒫 𝐵)
51 domtr 9034 . . 3 ((dom 𝑂 ≼ 𝒫 dom 𝑂 ∧ 𝒫 dom 𝑂 ≼ 𝒫 𝐵) → dom 𝑂 ≼ 𝒫 𝐵)
5229, 50, 51syl2anc 596 . 2 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼ 𝒫 𝐵)
53 elharval 9555 . 2 (dom 𝑂 ∈ (har‘𝒫 𝐵) ↔ (dom 𝑂 ∈ On ∧ dom 𝑂 ≼ 𝒫 𝐵))
5426, 52, 53sylanbrc 595 1 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ∈ (har‘𝒫 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867   class class class wbr 5103   E cep 5550   Se wse 5602   We wwe 5603  dom cdm 5651  ran crn 5652  Ord word 6361  Oncon0 6362  suc csuc 6364  ⟶wf 6534  –1-1-onto→wf1o 6537  ‘cfv 6538   Isom wiso 6539  Smo wsmo 8353   ≈ cen 8970   ≼ cdom 8971   ≺ csdm 8972  OrdIsocoi 9503  harchar 9550   ≼* cwdom 9558
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-pow 5327  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-rmo 3366  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-se 5605  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-isom 6547  df-riota 7377  df-ov 7423  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-smo 8354  df-recs 8379  df-en 8974  df-dom 8975  df-sdom 8976  df-oi 9504  df-har 9551  df-wdom 9559
This theorem is used by:  hsmexlem2  10505  hsmexlem4  10507
  Copyright terms: Public domain W3C validator