| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isf32lem10 | Structured version Visualization version GIF version | ||
| Description: Lemma for isfin3-2 . Write in terms of weak dominance. (Contributed by Stefan O'Rear, 6-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
| Ref | Expression |
|---|---|
| isf32lem.a | ⊢ (𝜑 → 𝐹:ω⟶𝒫 𝐺) |
| isf32lem.b | ⊢ (𝜑 → ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ⊆ (𝐹‘𝑥)) |
| isf32lem.c | ⊢ (𝜑 → ¬ ∩ ran 𝐹 ∈ ran 𝐹) |
| isf32lem.d | ⊢ 𝑆 = {𝑦 ∈ ω ∣ (𝐹‘suc 𝑦) ⊊ (𝐹‘𝑦)} |
| isf32lem.e | ⊢ 𝐽 = (𝑢 ∈ ω ↦ (℩𝑣 ∈ 𝑆 (𝑣 ∩ 𝑆) ≈ 𝑢)) |
| isf32lem.f | ⊢ 𝐾 = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽) |
| isf32lem.g | ⊢ 𝐿 = (𝑡 ∈ 𝐺 ↦ (℩𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠)))) |
| Ref | Expression |
|---|---|
| isf32lem10 | ⊢ (𝜑 → (𝐺 ∈ 𝑉 → ω ≼* 𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isf32lem.a | . . 3 ⊢ (𝜑 → 𝐹:ω⟶𝒫 𝐺) | |
| 2 | isf32lem.b | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ ω (𝐹‘suc 𝑥) ⊆ (𝐹‘𝑥)) | |
| 3 | isf32lem.c | . . 3 ⊢ (𝜑 → ¬ ∩ ran 𝐹 ∈ ran 𝐹) | |
| 4 | isf32lem.d | . . 3 ⊢ 𝑆 = {𝑦 ∈ ω ∣ (𝐹‘suc 𝑦) ⊊ (𝐹‘𝑦)} | |
| 5 | isf32lem.e | . . 3 ⊢ 𝐽 = (𝑢 ∈ ω ↦ (℩𝑣 ∈ 𝑆 (𝑣 ∩ 𝑆) ≈ 𝑢)) | |
| 6 | isf32lem.f | . . 3 ⊢ 𝐾 = ((𝑤 ∈ 𝑆 ↦ ((𝐹‘𝑤) ∖ (𝐹‘suc 𝑤))) ∘ 𝐽) | |
| 7 | isf32lem.g | . . 3 ⊢ 𝐿 = (𝑡 ∈ 𝐺 ↦ (℩𝑠(𝑠 ∈ ω ∧ 𝑡 ∈ (𝐾‘𝑠)))) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | isf32lem9 10452 | . 2 ⊢ (𝜑 → 𝐿:𝐺–onto→ω) |
| 9 | fof 6807 | . . . . 5 ⊢ (𝐿:𝐺–onto→ω → 𝐿:𝐺⟶ω) | |
| 10 | 8, 9 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐿:𝐺⟶ω) |
| 11 | fex 7242 | . . . 4 ⊢ ((𝐿:𝐺⟶ω ∧ 𝐺 ∈ 𝑉) → 𝐿 ∈ V) | |
| 12 | 10, 11 | sylan 592 | . . 3 ⊢ ((𝜑 ∧ 𝐺 ∈ 𝑉) → 𝐿 ∈ V) |
| 13 | 12 | ex 418 | . 2 ⊢ (𝜑 → (𝐺 ∈ 𝑉 → 𝐿 ∈ V)) |
| 14 | fowdom 9578 | . . 3 ⊢ ((𝐿 ∈ V ∧ 𝐿:𝐺–onto→ω) → ω ≼* 𝐺) | |
| 15 | 14 | expcom 419 | . 2 ⊢ (𝐿:𝐺–onto→ω → (𝐿 ∈ V → ω ≼* 𝐺)) |
| 16 | 8, 13, 15 | sylsyld 62 | 1 ⊢ (𝜑 → (𝐺 ∈ 𝑉 → ω ≼* 𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2146 ∀wral 3080 {crab 3416 Vcvv 3454 ⊆ wss 3900 ⊊ wpss 4016 ∖ cdif 4048 ∩ cin 4092 𝒫 cpw 4560 ∩ cint 4910 class class class wbr 5106 ↦ cmpt 5189 ran crn 5656 ∘ ccom 5659 suc csuc 6371 ℩cio 6499 ⟶wf 6543 –onto→wfo 6545 ‘cfv 6547 ℩crio 7386 ωcom 7887 ≈ cen 8984 ≼* cwdom 9571 |
| 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-pow 5331 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-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 4839 df-uni 4871 df-int 4911 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-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 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-isom 6556 df-riota 7387 df-ov 7433 df-om 7888 df-2nd 8012 df-frecs 8313 df-wrecs 8344 df-recs 8393 df-1o 8490 df-er 8731 df-en 8988 df-dom 8989 df-sdom 8990 df-fin 8991 df-wdom 9572 df-card 10033 |
| This theorem is used by: isf32lem11 10454 |
| Copyright terms: Public domain | W3C validator |