| 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 50800. (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 4878 | . . . 4 ⊢ (𝑥 = 𝑎 → ∪ 𝑥 = ∪ 𝑎) | |
| 2 | suceq 6431 | . . . . 5 ⊢ (∪ 𝑥 = ∪ 𝑎 → suc ∪ 𝑥 = suc ∪ 𝑎) | |
| 3 | 1, 2 | syl 18 | . . . 4 ⊢ (𝑥 = 𝑎 → suc ∪ 𝑥 = suc ∪ 𝑎) |
| 4 | 1, 3 | preq12d 4702 | . . 3 ⊢ (𝑥 = 𝑎 → {∪ 𝑥, suc ∪ 𝑥} = {∪ 𝑎, suc ∪ 𝑎}) |
| 5 | onsetreclem1.1 | . . 3 ⊢ 𝐹 = (𝑥 ∈ V ↦ {∪ 𝑥, suc ∪ 𝑥}) | |
| 6 | prex 5396 | . . 3 ⊢ {∪ 𝑎, suc ∪ 𝑎} ∈ V | |
| 7 | 4, 5, 6 | fvmpt 6993 | . 2 ⊢ (𝑎 ∈ V → (𝐹‘𝑎) = {∪ 𝑎, suc ∪ 𝑎}) |
| 8 | 7 | elv 3456 | 1 ⊢ (𝐹‘𝑎) = {∪ 𝑎, suc ∪ 𝑎} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 Vcvv 3451 {cpr 4586 ∪ cuni 4867 ↦ cmpt 5186 suc csuc 6364 ‘cfv 6538 |
| 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-sep 5249 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-suc 6368 df-iota 6494 df-fun 6540 df-fv 6546 |
| This theorem is used by: onsetreclem2 50798 onsetreclem3 50799 |
| Copyright terms: Public domain | W3C validator |