| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj523 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj852 35318. 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 |
|---|---|
| bnj523.1 | ⊢ (𝜑 ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅)) |
| bnj523.2 | ⊢ (𝜑′ ↔ [𝑀 / 𝑛]𝜑) |
| bnj523.3 | ⊢ 𝑀 ∈ V |
| Ref | Expression |
|---|---|
| bnj523 | ⊢ (𝜑′ ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj523.2 | . 2 ⊢ (𝜑′ ↔ [𝑀 / 𝑛]𝜑) | |
| 2 | bnj523.1 | . . 3 ⊢ (𝜑 ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅)) | |
| 3 | 2 | sbcbii 3799 | . 2 ⊢ ([𝑀 / 𝑛]𝜑 ↔ [𝑀 / 𝑛](𝐹‘∅) = pred(𝑋, 𝐴, 𝑅)) |
| 4 | bnj523.3 | . . 3 ⊢ 𝑀 ∈ V | |
| 5 | 4 | bnj525 35136 | . 2 ⊢ ([𝑀 / 𝑛](𝐹‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅)) |
| 6 | 1, 3, 5 | 3bitri 300 | 1 ⊢ (𝜑′ ↔ (𝐹‘∅) = pred(𝑋, 𝐴, 𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1569 ∈ wcel 2142 Vcvv 3454 [wsbc 3743 ∅c0 4285 ‘cfv 6536 predc-bnj14 35086 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-tru 1572 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-sbc 3744 |
| This theorem is used by: bnj600 35316 bnj908 35328 bnj934 35332 |
| Copyright terms: Public domain | W3C validator |