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

Theorem hsmexlem1 10543
Description: Lemma for hsmex 10549. 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 9560 . . 3 Ord dom 𝑂
3 relwdom 9597 . . . . . . . 8 Rel ≼*
43brrelex1i 5714 . . . . . . 7 (𝐴 ≼* 𝐵 → 𝐴 ∈ V)
54adantl 487 . . . . . 6 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝐴 ∈ V)
6 uniexg 7789 . . . . . 6 (𝐴 ∈ V → ∪ 𝐴 ∈ V)
7 sucexg 7853 . . . . . 6 (∪ 𝐴 ∈ V → suc ∪ 𝐴 ∈ V)
85, 6, 73syl 19 . . . . 5 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → suc ∪ 𝐴 ∈ V)
91oif 9561 . . . . . . 7 𝑂:dom 𝑂⟶𝐴
10 onsucuni 7873 . . . . . . . 8 (𝐴 ⊆ On → 𝐴 ⊆ suc ∪ 𝐴)
1110adantr 486 . . . . . . 7 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝐴 ⊆ suc ∪ 𝐴)
12 fss 6756 . . . . . . 7 ((𝑂:dom 𝑂⟶𝐴 ∧ 𝐴 ⊆ suc ∪ 𝐴) → 𝑂:dom 𝑂⟶suc ∪ 𝐴)
139, 11, 12sylancr 599 . . . . . 6 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝑂:dom 𝑂⟶suc ∪ 𝐴)
141oismo 9571 . . . . . . . 8 (𝐴 ⊆ On → (Smo 𝑂 ∧ ran 𝑂 = 𝐴))
1514adantr 486 . . . . . . 7 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → (Smo 𝑂 ∧ ran 𝑂 = 𝐴))
1615simpld 500 . . . . . 6 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → Smo 𝑂)
17 ssorduni 7827 . . . . . . . 8 (𝐴 ⊆ On → Ord ∪ 𝐴)
1817adantr 486 . . . . . . 7 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → Ord ∪ 𝐴)
19 ordsuc 7859 . . . . . . 7 (Ord ∪ 𝐴 ↔ Ord suc ∪ 𝐴)
2018, 19sylib 221 . . . . . 6 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → Ord suc ∪ 𝐴)
21 smocdmdom 8414 . . . . . 6 ((𝑂:dom 𝑂⟶suc ∪ 𝐴 ∧ Smo 𝑂 ∧ Ord suc ∪ 𝐴) → dom 𝑂 ⊆ suc ∪ 𝐴)
2213, 16, 20, 21syl3anc 1399 . . . . 5 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ⊆ suc ∪ 𝐴)
238, 22ssexd 5293 . . . 4 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ∈ V)
24 elong 6396 . . . 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 9188 . . . 4 (dom 𝑂 ∈ V → dom 𝑂 ≺ 𝒫 dom 𝑂)
28 sdomdom 9045 . . . 4 (dom 𝑂 ≺ 𝒫 dom 𝑂 → dom 𝑂 ≼ 𝒫 dom 𝑂)
2923, 27, 283syl 19 . . 3 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼ 𝒫 dom 𝑂)
30 simpl 488 . . . . . . . . . . 11 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝐴 ⊆ On)
31 epweon 7821 . . . . . . . . . . 11 E We On
32 wess 5644 . . . . . . . . . . 11 (𝐴 ⊆ On → ( E We On → E We 𝐴))
3330, 31, 32mpisyl 22 . . . . . . . . . 10 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → E We 𝐴)
34 epse 5640 . . . . . . . . . 10 E Se 𝐴
351oiiso2 9562 . . . . . . . . . 10 (( E We 𝐴 ∧ E Se 𝐴) → 𝑂 Isom E , E (dom 𝑂, ran 𝑂))
3633, 34, 35sylancl 598 . . . . . . . . 9 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝑂 Isom E , E (dom 𝑂, ran 𝑂))
37 isof1o 7362 . . . . . . . . 9 (𝑂 Isom E , E (dom 𝑂, ran 𝑂) → 𝑂:dom 𝑂⟶1-1ontoran 𝑂)
3836, 37syl 18 . . . . . . . 8 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝑂:dom 𝑂⟶1-1ontoran 𝑂)
3915simprd 501 . . . . . . . . 9 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → ran 𝑂 = 𝐴)
4039f1oeq3d 6851 . . . . . . . 8 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → (𝑂:dom 𝑂⟶1-1ontoran 𝑂 ↔ 𝑂:dom 𝑂⟶1-1onto𝐴))
4138, 40mpbid 235 . . . . . . 7 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝑂:dom 𝑂⟶1-1onto𝐴)
42 f1oen2g 9033 . . . . . . 7 ((dom 𝑂 ∈ On ∧ 𝐴 ∈ V ∧ 𝑂:dom 𝑂⟶1-1onto𝐴) → dom 𝑂 ≈ 𝐴)
4326, 5, 41, 42syl3anc 1399 . . . . . 6 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≈ 𝐴)
44 endom 9044 . . . . . 6 (dom 𝑂 ≈ 𝐴 → dom 𝑂 ≼ 𝐴)
45 domwdom 9605 . . . . . 6 (dom 𝑂 ≼ 𝐴 → dom 𝑂 ≼* 𝐴)
4643, 44, 453syl 19 . . . . 5 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼* 𝐴)
47 wdomtr 9606 . . . . 5 ((dom 𝑂 ≼* 𝐴 ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼* 𝐵)
4846, 47sylancom 600 . . . 4 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼* 𝐵)
49 wdompwdom 9609 . . . 4 (dom 𝑂 ≼* 𝐵 → 𝒫 dom 𝑂 ≼ 𝒫 𝐵)
5048, 49syl 18 . . 3 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → 𝒫 dom 𝑂 ≼ 𝒫 𝐵)
51 domtr 9072 . . 3 ((dom 𝑂 ≼ 𝒫 dom 𝑂 ∧ 𝒫 dom 𝑂 ≼ 𝒫 𝐵) → dom 𝑂 ≼ 𝒫 𝐵)
5229, 50, 51syl2anc 596 . 2 ((𝐴 ⊆ On ∧ 𝐴 ≼* 𝐵) → dom 𝑂 ≼ 𝒫 𝐵)
53 elharval 9592 . 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 2147  Vcvv 3454   ⊆ wss 3900  𝒫 cpw 4560  ∪ cuni 4872   class class class wbr 5108   E cep 5557   Se wse 5609   We wwe 5610  dom cdm 5658  ran crn 5659  Ord word 6387  Oncon0 6388  suc csuc 6390  ⟶wf 6562  ⟶1-1ontowf1o 6565  ‘cfv 6566   Isom wiso 6567  Smo wsmo 8391   ≈ cen 9008   ≼ cdom 9009   ≺ csdm 9010  OrdIsocoi 9540  harchar 9587   ≼* cwdom 9595
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  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-rmo 3369  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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-smo 8392  df-recs 8417  df-en 9012  df-dom 9013  df-sdom 9014  df-oi 9541  df-har 9588  df-wdom 9596
This theorem is used by:  hsmexlem2  10544  hsmexlem4  10546
  Copyright terms: Public domain W3C validator