| 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 10360 | . 2 ⊢ (𝜑 → 𝐿:𝐺–onto→ω) |
| 9 | fof 6796 | . . . . 5 ⊢ (𝐿:𝐺–onto→ω → 𝐿:𝐺⟶ω) | |
| 10 | 8, 9 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐿:𝐺⟶ω) |
| 11 | fex 7231 | . . . 4 ⊢ ((𝐿:𝐺⟶ω ∧ 𝐺 ∈ 𝑉) → 𝐿 ∈ V) | |
| 12 | 10, 11 | sylan 592 | . . 3 ⊢ ((𝜑 ∧ 𝐺 ∈ 𝑉) → 𝐿 ∈ V) |
| 13 | 12 | ex 418 | . 2 ⊢ (𝜑 → (𝐺 ∈ 𝑉 → 𝐿 ∈ V)) |
| 14 | fowdom 9540 | . . 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 1570 ∈ wcel 2146 ∀wral 3081 {crab 3418 Vcvv 3457 ∖ cdif 3903 ∩ cin 3905 ⊆ wss 3906 ⊊ wpss 3907 𝒫 cpw 4564 ∩ cint 4914 class class class wbr 5111 ↦ cmpt 5194 ran crn 5664 ∘ ccom 5667 suc csuc 6366 ℩cio 6494 ⟶wf 6536 –onto→wfo 6538 ‘cfv 6540 ℩crio 7375 ωcom 7868 ≈ cen 8946 ≼* cwdom 9533 |
| 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-pow 5338 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-rmo 3371 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-int 4915 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-se 5617 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-isom 6549 df-riota 7376 df-ov 7422 df-om 7869 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-1o 8459 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-wdom 9534 df-card 9941 |
| This theorem is used by: isf32lem11 10362 |
| Copyright terms: Public domain | W3C validator |