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 39664 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ On (𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴) |
5 | f1ofo 6622 | . . . . . 6 ⊢ ((𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴 → (𝐹 ↾ 𝑥):𝑥–onto→𝐴) | |
6 | forn 6593 | . . . . . 6 ⊢ ((𝐹 ↾ 𝑥):𝑥–onto→𝐴 → ran (𝐹 ↾ 𝑥) = 𝐴) | |
7 | 5, 6 | syl 17 | . . . . 5 ⊢ ((𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴 → ran (𝐹 ↾ 𝑥) = 𝐴) |
8 | resss 5878 | . . . . . 6 ⊢ (𝐹 ↾ 𝑥) ⊆ 𝐹 | |
9 | rnss 5809 | . . . . . 6 ⊢ ((𝐹 ↾ 𝑥) ⊆ 𝐹 → ran (𝐹 ↾ 𝑥) ⊆ ran 𝐹) | |
10 | 8, 9 | mp1i 13 | . . . . 5 ⊢ ((𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴 → ran (𝐹 ↾ 𝑥) ⊆ ran 𝐹) |
11 | 7, 10 | eqsstrrd 4006 | . . . 4 ⊢ ((𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴 → 𝐴 ⊆ ran 𝐹) |
12 | 11 | a1i 11 | . . 3 ⊢ (𝜑 → ((𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴 → 𝐴 ⊆ ran 𝐹)) |
13 | 12 | rexlimdvw 3290 | . 2 ⊢ (𝜑 → (∃𝑥 ∈ On (𝐹 ↾ 𝑥):𝑥–1-1-onto→𝐴 → 𝐴 ⊆ ran 𝐹)) |
14 | 4, 13 | mpd 15 | 1 ⊢ (𝜑 → 𝐴 ⊆ ran 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 ≠ wne 3016 ∀wral 3138 ∃wrex 3139 Vcvv 3494 ∖ cdif 3933 ⊆ wss 3936 ∅c0 4291 𝒫 cpw 4539 ↦ cmpt 5146 ran crn 5556 ↾ cres 5557 Oncon0 6191 –onto→wfo 6353 –1-1-onto→wf1o 6354 ‘cfv 6355 recscrecs 8007 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-wrecs 7947 df-recs 8008 |
This theorem is referenced by: dnnumch3lem 39666 dnnumch3 39667 |
Copyright terms: Public domain | W3C validator |