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 32197. 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 3832 | . 2 ⊢ ([𝐺 / 𝑓]𝜑 ↔ [𝐺 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) |
4 | bnj526.3 | . . 3 ⊢ 𝐺 ∈ V | |
5 | fveq1 6672 | . . . 4 ⊢ (𝑓 = 𝐺 → (𝑓‘∅) = (𝐺‘∅)) | |
6 | 5 | eqeq1d 2826 | . . 3 ⊢ (𝑓 = 𝐺 → ((𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅))) |
7 | 4, 6 | sbcie 3815 | . 2 ⊢ ([𝐺 / 𝑓](𝑓‘∅) = pred(𝑋, 𝐴, 𝑅) ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅)) |
8 | 1, 3, 7 | 3bitri 299 | 1 ⊢ (𝜑″ ↔ (𝐺‘∅) = pred(𝑋, 𝐴, 𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 = wceq 1536 ∈ wcel 2113 Vcvv 3497 [wsbc 3775 ∅c0 4294 ‘cfv 6358 predc-bnj14 31962 |
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 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-v 3499 df-sbc 3776 df-in 3946 df-ss 3955 df-uni 4842 df-br 5070 df-iota 6317 df-fv 6366 |
This theorem is referenced by: bnj607 32192 |
Copyright terms: Public domain | W3C validator |