| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj126 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj150 35011. 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 |
|---|---|
| bnj126.1 | ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
| bnj126.2 | ⊢ (𝜓′ ↔ [1o / 𝑛]𝜓) |
| bnj126.3 | ⊢ (𝜓″ ↔ [𝐹 / 𝑓]𝜓′) |
| bnj126.4 | ⊢ 𝐹 = {〈∅, pred(𝑥, 𝐴, 𝑅)〉} |
| Ref | Expression |
|---|---|
| bnj126 | ⊢ (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj126.3 | . 2 ⊢ (𝜓″ ↔ [𝐹 / 𝑓]𝜓′) | |
| 2 | bnj126.2 | . . 3 ⊢ (𝜓′ ↔ [1o / 𝑛]𝜓) | |
| 3 | 2 | sbcbii 3796 | . 2 ⊢ ([𝐹 / 𝑓]𝜓′ ↔ [𝐹 / 𝑓][1o / 𝑛]𝜓) |
| 4 | bnj126.1 | . . 3 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) | |
| 5 | bnj126.4 | . . . 4 ⊢ 𝐹 = {〈∅, pred(𝑥, 𝐴, 𝑅)〉} | |
| 6 | 5 | bnj95 34999 | . . 3 ⊢ 𝐹 ∈ V |
| 7 | 4, 6 | bnj106 35003 | . 2 ⊢ ([𝐹 / 𝑓][1o / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
| 8 | 1, 3, 7 | 3bitri 297 | 1 ⊢ (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 ∈ wcel 2114 ∀wral 3050 [wsbc 3739 ∅c0 4284 {csn 4579 〈cop 4585 ∪ ciun 4945 suc csuc 6318 ‘cfv 6491 ωcom 7808 1oc1o 8390 predc-bnj14 34823 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ral 3051 df-rex 3060 df-v 3441 df-sbc 3740 df-dif 3903 df-un 3905 df-ss 3917 df-nul 4285 df-pw 4555 df-sn 4580 df-pr 4582 df-uni 4863 df-iun 4947 df-br 5098 df-suc 6322 df-iota 6447 df-fv 6499 df-1o 8397 |
| This theorem is referenced by: bnj150 35011 bnj153 35015 |
| Copyright terms: Public domain | W3C validator |