Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj526 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj852 30991. 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 |
---|---|
bnj526.1 | ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) |
bnj526.2 | ⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑) |
bnj526.3 | ⊢ 𝐺 ∈ V |
Ref | Expression |
---|---|
bnj526 | ⊢ (𝜑″ ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj526.2 | . 2 ⊢ (𝜑″ ↔ [𝐺 / 𝑓]𝜑) | |
2 | bnj526.1 | . . 3 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) | |
3 | 2 | sbcbii 3491 | . 2 ⊢ ([𝐺 / 𝑓]𝜑 ↔ [𝐺 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) |
4 | bnj526.3 | . . 3 ⊢ 𝐺 ∈ V | |
5 | fveq1 6190 | . . . 4 ⊢ (𝑓 = 𝐺 → (𝑓‘∅) = (𝐺‘∅)) | |
6 | 5 | eqeq1d 2624 | . . 3 ⊢ (𝑓 = 𝐺 → ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅))) |
7 | 4, 6 | sbcie 3470 | . 2 ⊢ ([𝐺 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅)) |
8 | 1, 3, 7 | 3bitri 286 | 1 ⊢ (𝜑″ ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 = wceq 1483 ∈ wcel 1990 Vcvv 3200 [wsbc 3435 ∅c0 3915 ‘cfv 5888 predc-bnj14 30754 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-rex 2918 df-v 3202 df-sbc 3436 df-uni 4437 df-br 4654 df-iota 5851 df-fv 5896 |
This theorem is referenced by: bnj607 30986 |
Copyright terms: Public domain | W3C validator |