| 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 10439 | . 2 ⊢ (𝜑 → 𝐿:𝐺–onto→ω) |
| 9 | fof 6796 | . . . . 5 ⊢ (𝐿:𝐺–onto→ω → 𝐿:𝐺⟶ω) | |
| 10 | 8, 9 | syl 18 | . . . 4 ⊢ (𝜑 → 𝐿:𝐺⟶ω) |
| 11 | fex 7232 | . . . 4 ⊢ ((𝐿:𝐺⟶ω ∧ 𝐺 ∈ 𝑉) → 𝐿 ∈ V) | |
| 12 | 10, 11 | sylan 592 | . . 3 ⊢ ((𝜑 ∧ 𝐺 ∈ 𝑉) → 𝐿 ∈ V) |
| 13 | 12 | ex 418 | . 2 ⊢ (𝜑 → (𝐺 ∈ 𝑉 → 𝐿 ∈ V)) |
| 14 | fowdom 9565 | . . 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 2145 ∀wral 3077 {crab 3413 Vcvv 3451 ∖ cdif 3896 ∩ cin 3898 ⊆ wss 3899 ⊊ wpss 3900 𝒫 cpw 4557 ∩ cint 4907 class class class wbr 5103 ↦ cmpt 5186 ran crn 5652 ∘ ccom 5655 suc csuc 6364 ℩cio 6492 ⟶wf 6534 –onto→wfo 6536 ‘cfv 6538 ℩crio 7376 ωcom 7877 ≈ cen 8970 ≼* 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-int 4908 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-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-1o 8476 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-wdom 9559 df-card 10020 |
| This theorem is used by: isf32lem11 10441 |
| Copyright terms: Public domain | W3C validator |