![]() |
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 34230. 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 3836 | . 2 ⊢ ([𝐺 / 𝑓]𝜑 ↔ [𝐺 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) |
4 | bnj526.3 | . . 3 ⊢ 𝐺 ∈ V | |
5 | fveq1 6889 | . . . 4 ⊢ (𝑓 = 𝐺 → (𝑓‘∅) = (𝐺‘∅)) | |
6 | 5 | eqeq1d 2732 | . . 3 ⊢ (𝑓 = 𝐺 → ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅))) |
7 | 4, 6 | sbcie 3819 | . 2 ⊢ ([𝐺 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅)) |
8 | 1, 3, 7 | 3bitri 296 | 1 ⊢ (𝜑″ ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 = wceq 1539 ∈ wcel 2104 Vcvv 3472 [wsbc 3776 ∅c0 4321 ‘cfv 6542 predc-bnj14 33997 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-ext 2701 |
This theorem depends on definitions: df-bi 206 df-an 395 df-tru 1542 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2722 df-clel 2808 df-v 3474 df-sbc 3777 df-in 3954 df-ss 3964 df-uni 4908 df-br 5148 df-iota 6494 df-fv 6550 |
This theorem is referenced by: bnj607 34225 |
Copyright terms: Public domain | W3C validator |