![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj222 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj229 34194. 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 |
---|---|
bnj222.1 | ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
Ref | Expression |
---|---|
bnj222 | ⊢ (𝜓 ↔ ∀𝑚 ∈ ω (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj222.1 | . 2 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) | |
2 | suceq 6430 | . . . . 5 ⊢ (𝑖 = 𝑚 → suc 𝑖 = suc 𝑚) | |
3 | 2 | eleq1d 2817 | . . . 4 ⊢ (𝑖 = 𝑚 → (suc 𝑖 ∈ 𝑁 ↔ suc 𝑚 ∈ 𝑁)) |
4 | 2 | fveq2d 6895 | . . . . 5 ⊢ (𝑖 = 𝑚 → (𝐹‘suc 𝑖) = (𝐹‘suc 𝑚)) |
5 | fveq2 6891 | . . . . . 6 ⊢ (𝑖 = 𝑚 → (𝐹‘𝑖) = (𝐹‘𝑚)) | |
6 | 5 | bnj1113 34095 | . . . . 5 ⊢ (𝑖 = 𝑚 → ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅)) |
7 | 4, 6 | eqeq12d 2747 | . . . 4 ⊢ (𝑖 = 𝑚 → ((𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅) ↔ (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅))) |
8 | 3, 7 | imbi12d 344 | . . 3 ⊢ (𝑖 = 𝑚 → ((suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅)))) |
9 | 8 | cbvralvw 3233 | . 2 ⊢ (∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑁 → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ ∀𝑚 ∈ ω (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅))) |
10 | 1, 9 | bitri 275 | 1 ⊢ (𝜓 ↔ ∀𝑚 ∈ ω (suc 𝑚 ∈ 𝑁 → (𝐹‘suc 𝑚) = ∪ 𝑦 ∈ (𝐹‘𝑚) pred(𝑦, 𝐴, 𝑅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1540 ∈ wcel 2105 ∀wral 3060 ∪ ciun 4997 suc csuc 6366 ‘cfv 6543 ωcom 7858 predc-bnj14 33998 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2723 df-clel 2809 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-suc 6370 df-iota 6495 df-fv 6551 |
This theorem is referenced by: bnj229 34194 bnj589 34219 |
Copyright terms: Public domain | W3C validator |