| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj154 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj153 35015. 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 |
|---|---|
| bnj154.1 | ⊢ (𝜑1 ↔ [𝑔 / 𝑓]𝜑′) |
| bnj154.2 | ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) |
| Ref | Expression |
|---|---|
| bnj154 | ⊢ (𝜑1 ↔ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj154.1 | . 2 ⊢ (𝜑1 ↔ [𝑔 / 𝑓]𝜑′) | |
| 2 | bnj154.2 | . . 3 ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) | |
| 3 | 2 | sbcbii 3796 | . 2 ⊢ ([𝑔 / 𝑓]𝜑′ ↔ [𝑔 / 𝑓](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) |
| 4 | vex 3443 | . . 3 ⊢ 𝑔 ∈ V | |
| 5 | fveq1 6832 | . . . 4 ⊢ (𝑓 = 𝑔 → (𝑓‘∅) = (𝑔‘∅)) | |
| 6 | 5 | eqeq1d 2737 | . . 3 ⊢ (𝑓 = 𝑔 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅))) |
| 7 | 4, 6 | sbcie 3781 | . 2 ⊢ ([𝑔 / 𝑓](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅)) |
| 8 | 1, 3, 7 | 3bitri 297 | 1 ⊢ (𝜑1 ↔ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1542 [wsbc 3739 ∅c0 4284 ‘cfv 6491 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-ext 2707 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2714 df-cleq 2727 df-clel 2810 df-v 3441 df-sbc 3740 df-ss 3917 df-uni 4863 df-br 5098 df-iota 6447 df-fv 6499 |
| This theorem is referenced by: bnj153 35015 bnj580 35048 bnj607 35051 |
| Copyright terms: Public domain | W3C validator |