| 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 35573. 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 3798 | . 2 ⊢ ([𝐹 / 𝑓]𝜓′ ↔ [𝐹 / 𝑓][1o / 𝑛]𝜓) |
| 4 | bnj126.1 | . . 3 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) | |
| 5 | bnj126.4 | . . . 4 ⊢ 𝐹 = {〈∅, pred(𝑥, 𝐴, 𝑅)〉} | |
| 6 | 5 | bnj95 35561 | . . 3 ⊢ 𝐹 ∈ V |
| 7 | 4, 6 | bnj106 35565 | . 2 ⊢ ([𝐹 / 𝑓][1o / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
| 8 | 1, 3, 7 | 3bitri 300 | 1 ⊢ (𝜓″ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝐹‘suc 𝑖) = ∪ 𝑦 ∈ (𝐹‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2147 ∀wral 3080 [wsbc 3742 ∅c0 4281 {csn 4588 〈cop 4838 ∪ ciun 4954 suc csuc 6379 ‘cfv 6555 ωcom 7898 1oc1o 8494 predc-bnj14 35386 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ral 3081 df-rex 3091 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-pw 4562 df-sn 4589 df-pr 4591 df-uni 4871 df-iun 4956 df-br 5107 df-suc 6383 df-iota 6509 df-fv 6563 df-1o 8501 |
| This theorem is used by: bnj150 35573 bnj153 35577 |
| Copyright terms: Public domain | W3C validator |