![]() |
Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dnnumch2 | Structured version Visualization version GIF version |
Description: Define an enumeration (weak dominance version) of a set from a choice function. (Contributed by Stefan O'Rear, 18-Jan-2015.) |
Ref | Expression |
---|---|
dnnumch.f | ⊢ 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) |
dnnumch.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
dnnumch.g | ⊢ (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺‘𝑦) ∈ 𝑦)) |
Ref | Expression |
---|---|
dnnumch2 | ⊢ (𝜑 → 𝐴 ⊆ ran 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dnnumch.f | . . 3 ⊢ 𝐹 = recs((𝑧 ∈ V ↦ (𝐺‘(𝐴 ∖ ran 𝑧)))) | |
2 | dnnumch.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
3 | dnnumch.g | . . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝒫 𝐴(𝑦 ≠ ∅ → (𝐺‘𝑦) ∈ 𝑦)) | |
4 | 1, 2, 3 | dnnumch1 38573 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ On (𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴) |
5 | f1ofo 6398 | . . . . . 6 ⊢ ((𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴 → (𝐹 ↾ 𝑥):𝑥–onto→𝐴) | |
6 | forn 6369 | . . . . . 6 ⊢ ((𝐹 ↾ 𝑥):𝑥–onto→𝐴 → ran (𝐹 ↾ 𝑥) = 𝐴) | |
7 | 5, 6 | syl 17 | . . . . 5 ⊢ ((𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴 → ran (𝐹 ↾ 𝑥) = 𝐴) |
8 | resss 5671 | . . . . . 6 ⊢ (𝐹 ↾ 𝑥) ⊆ 𝐹 | |
9 | rnss 5599 | . . . . . 6 ⊢ ((𝐹 ↾ 𝑥) ⊆ 𝐹 → ran (𝐹 ↾ 𝑥) ⊆ ran 𝐹) | |
10 | 8, 9 | mp1i 13 | . . . . 5 ⊢ ((𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴 → ran (𝐹 ↾ 𝑥) ⊆ ran 𝐹) |
11 | 7, 10 | eqsstr3d 3859 | . . . 4 ⊢ ((𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴 → 𝐴 ⊆ ran 𝐹) |
12 | 11 | a1i 11 | . . 3 ⊢ (𝜑 → ((𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴 → 𝐴 ⊆ ran 𝐹)) |
13 | 12 | rexlimdvw 3217 | . 2 ⊢ (𝜑 → (∃𝑥 ∈ On (𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴 → 𝐴 ⊆ ran 𝐹)) |
14 | 4, 13 | mpd 15 | 1 ⊢ (𝜑 → 𝐴 ⊆ ran 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1601 ∈ wcel 2107 ≠ wne 2969 ∀wral 3090 ∃wrex 3091 Vcvv 3398 ∖ cdif 3789 ⊆ wss 3792 ∅c0 4141 𝒫 cpw 4379 ↦ cmpt 4965 ran crn 5356 ↾ cres 5357 Oncon0 5976 –onto→wfo 6133 –1-1-onto→wf1o 6134 ‘cfv 6135 recscrecs 7750 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-rep 5006 ax-sep 5017 ax-nul 5025 ax-pow 5077 ax-pr 5138 ax-un 7226 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-ral 3095 df-rex 3096 df-reu 3097 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4672 df-int 4711 df-iun 4755 df-br 4887 df-opab 4949 df-mpt 4966 df-tr 4988 df-id 5261 df-eprel 5266 df-po 5274 df-so 5275 df-fr 5314 df-we 5316 df-xp 5361 df-rel 5362 df-cnv 5363 df-co 5364 df-dm 5365 df-rn 5366 df-res 5367 df-ima 5368 df-pred 5933 df-ord 5979 df-on 5980 df-suc 5982 df-iota 6099 df-fun 6137 df-fn 6138 df-f 6139 df-f1 6140 df-fo 6141 df-f1o 6142 df-fv 6143 df-wrecs 7689 df-recs 7751 |
This theorem is referenced by: dnnumch3lem 38575 dnnumch3 38576 |
Copyright terms: Public domain | W3C validator |