Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj590 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj852 32901. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
Ref | Expression |
---|---|
bnj590.1 | ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
Ref | Expression |
---|---|
bnj590 | ⊢ ((𝐵 = suc 𝑖 ∧ 𝜓) → (𝑖 ∈ ω → (𝐵 ∈ 𝑛 → (𝑓‘𝐵) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj590.1 | . . . 4 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) | |
2 | rsp 3131 | . . . 4 ⊢ (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) → (𝑖 ∈ ω → (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))) | |
3 | 1, 2 | sylbi 216 | . . 3 ⊢ (𝜓 → (𝑖 ∈ ω → (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))) |
4 | eleq1 2826 | . . . . 5 ⊢ (𝐵 = suc 𝑖 → (𝐵 ∈ 𝑛 ↔ suc 𝑖 ∈ 𝑛)) | |
5 | fveqeq2 6783 | . . . . 5 ⊢ (𝐵 = suc 𝑖 → ((𝑓‘𝐵) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) | |
6 | 4, 5 | imbi12d 345 | . . . 4 ⊢ (𝐵 = suc 𝑖 → ((𝐵 ∈ 𝑛 → (𝑓‘𝐵) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))) |
7 | 6 | imbi2d 341 | . . 3 ⊢ (𝐵 = suc 𝑖 → ((𝑖 ∈ ω → (𝐵 ∈ 𝑛 → (𝑓‘𝐵) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ (𝑖 ∈ ω → (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))))) |
8 | 3, 7 | syl5ibr 245 | . 2 ⊢ (𝐵 = suc 𝑖 → (𝜓 → (𝑖 ∈ ω → (𝐵 ∈ 𝑛 → (𝑓‘𝐵) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))))) |
9 | 8 | imp 407 | 1 ⊢ ((𝐵 = suc 𝑖 ∧ 𝜓) → (𝑖 ∈ ω → (𝐵 ∈ 𝑛 → (𝑓‘𝐵) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ∀wral 3064 ∪ ciun 4924 suc csuc 6268 ‘cfv 6433 ωcom 7712 predc-bnj14 32667 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ral 3069 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-iota 6391 df-fv 6441 |
This theorem is referenced by: bnj594 32892 |
Copyright terms: Public domain | W3C validator |