| Mathbox for Emmett Weisz |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > onsetreclem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for onsetrec 49895. (Contributed by Emmett Weisz, 22-Jun-2021.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| onsetreclem1.1 | ⊢ 𝐹 = (𝑥 ∈ V ↦ {∪ 𝑥, suc ∪ 𝑥}) |
| Ref | Expression |
|---|---|
| onsetreclem1 | ⊢ (𝐹‘𝑎) = {∪ 𝑎, suc ∪ 𝑎} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | unieq 4872 | . . . 4 ⊢ (𝑥 = 𝑎 → ∪ 𝑥 = ∪ 𝑎) | |
| 2 | suceq 6383 | . . . . 5 ⊢ (∪ 𝑥 = ∪ 𝑎 → suc ∪ 𝑥 = suc ∪ 𝑎) | |
| 3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝑥 = 𝑎 → suc ∪ 𝑥 = suc ∪ 𝑎) |
| 4 | 1, 3 | preq12d 4696 | . . 3 ⊢ (𝑥 = 𝑎 → {∪ 𝑥, suc ∪ 𝑥} = {∪ 𝑎, suc ∪ 𝑎}) |
| 5 | onsetreclem1.1 | . . 3 ⊢ 𝐹 = (𝑥 ∈ V ↦ {∪ 𝑥, suc ∪ 𝑥}) | |
| 6 | prex 5380 | . . 3 ⊢ {∪ 𝑎, suc ∪ 𝑎} ∈ V | |
| 7 | 4, 5, 6 | fvmpt 6939 | . 2 ⊢ (𝑎 ∈ V → (𝐹‘𝑎) = {∪ 𝑎, suc ∪ 𝑎}) |
| 8 | 7 | elv 3443 | 1 ⊢ (𝐹‘𝑎) = {∪ 𝑎, suc ∪ 𝑎} |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1541 Vcvv 3438 {cpr 4580 ∪ cuni 4861 ↦ cmpt 5177 suc csuc 6317 ‘cfv 6490 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4284 df-if 4478 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-suc 6321 df-iota 6446 df-fun 6492 df-fv 6498 |
| This theorem is referenced by: onsetreclem2 49893 onsetreclem3 49894 |
| Copyright terms: Public domain | W3C validator |