| Mathbox for Emmett Weisz |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > elsetrecs | Structured version Visualization version GIF version | ||
| Description: A set 𝐴 is an element of setrecs(𝐹) iff 𝐴 is generated by some subset of setrecs(𝐹). The proof requires both setrec1 9996 and setrec2 10001, but this theorem is not strong enough to uniquely determine setrecs(𝐹). If 𝐹 respects the subset relation, the theorem still holds if both occurrences of ∈ are replaced by ⊆ for a stronger version of the theorem. (Contributed by Emmett Weisz, 12-Jul-2021.) |
| Ref | Expression |
|---|---|
| elsetrecs.1 | ⊢ 𝐵 = setrecs(𝐹) |
| Ref | Expression |
|---|---|
| elsetrecs | ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 ∈ (𝐹‘𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elsetrecs.1 | . . 3 ⊢ 𝐵 = setrecs(𝐹) | |
| 2 | 1 | elsetrecslem 51070 | . 2 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 ∈ (𝐹‘𝑥))) |
| 3 | vex 3458 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ (𝑥 ⊆ 𝐵 → 𝑥 ∈ V) |
| 5 | id 23 | . . . . 5 ⊢ (𝑥 ⊆ 𝐵 → 𝑥 ⊆ 𝐵) | |
| 6 | 1, 4, 5 | setrec1 9996 | . . . 4 ⊢ (𝑥 ⊆ 𝐵 → (𝐹‘𝑥) ⊆ 𝐵) |
| 7 | 6 | sselda 3913 | . . 3 ⊢ ((𝑥 ⊆ 𝐵 ∧ 𝐴 ∈ (𝐹‘𝑥)) → 𝐴 ∈ 𝐵) |
| 8 | 7 | exlimiv 1965 | . 2 ⊢ (∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 ∈ (𝐹‘𝑥)) → 𝐴 ∈ 𝐵) |
| 9 | 2, 8 | impbii 212 | 1 ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 ⊆ 𝐵 ∧ 𝐴 ∈ (𝐹‘𝑥))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2147 Vcvv 3454 ⊆ wss 3900 ‘cfv 6555 setrecscsetrecs 9988 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-reg 9610 ax-inf2 9666 |
| 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 2102 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-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-iin 4957 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-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 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-ov 7443 df-om 7899 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-r1 9792 df-rank 9793 df-scott 9953 df-setrecs 9989 |
| This theorem is used by: elpg 51085 |
| Copyright terms: Public domain | W3C validator |