![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1529 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj1522 31140. 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 |
---|---|
bnj1529.1 | ⊢ (𝜒 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉)) |
bnj1529.2 | ⊢ (𝑤 ∈ 𝐹 → ∀𝑥 𝑤 ∈ 𝐹) |
Ref | Expression |
---|---|
bnj1529 | ⊢ (𝜒 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐺‘〈𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))〉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1529.1 | . 2 ⊢ (𝜒 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉)) | |
2 | nfv 1843 | . . 3 ⊢ Ⅎ𝑦(𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) | |
3 | bnj1529.2 | . . . . . 6 ⊢ (𝑤 ∈ 𝐹 → ∀𝑥 𝑤 ∈ 𝐹) | |
4 | 3 | nfcii 2755 | . . . . 5 ⊢ Ⅎ𝑥𝐹 |
5 | nfcv 2764 | . . . . 5 ⊢ Ⅎ𝑥𝑦 | |
6 | 4, 5 | nffv 6198 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑦) |
7 | nfcv 2764 | . . . . 5 ⊢ Ⅎ𝑥𝐺 | |
8 | nfcv 2764 | . . . . . . 7 ⊢ Ⅎ𝑥 pred(𝑦, 𝐴, 𝑅) | |
9 | 4, 8 | nfres 5398 | . . . . . 6 ⊢ Ⅎ𝑥(𝐹 ↾ pred(𝑦, 𝐴, 𝑅)) |
10 | 5, 9 | nfop 4418 | . . . . 5 ⊢ Ⅎ𝑥〈𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))〉 |
11 | 7, 10 | nffv 6198 | . . . 4 ⊢ Ⅎ𝑥(𝐺‘〈𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))〉) |
12 | 6, 11 | nfeq 2776 | . . 3 ⊢ Ⅎ𝑥(𝐹‘𝑦) = (𝐺‘〈𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))〉) |
13 | fveq2 6191 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐹‘𝑥) = (𝐹‘𝑦)) | |
14 | id 22 | . . . . . 6 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦) | |
15 | bnj602 30985 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → pred(𝑥, 𝐴, 𝑅) = pred(𝑦, 𝐴, 𝑅)) | |
16 | 15 | reseq2d 5396 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐹 ↾ pred(𝑥, 𝐴, 𝑅)) = (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))) |
17 | 14, 16 | opeq12d 4410 | . . . . 5 ⊢ (𝑥 = 𝑦 → 〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉 = 〈𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))〉) |
18 | 17 | fveq2d 6195 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) = (𝐺‘〈𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))〉)) |
19 | 13, 18 | eqeq12d 2637 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) ↔ (𝐹‘𝑦) = (𝐺‘〈𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))〉))) |
20 | 2, 12, 19 | cbvral 3167 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) ↔ ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐺‘〈𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))〉)) |
21 | 1, 20 | sylib 208 | 1 ⊢ (𝜒 → ∀𝑦 ∈ 𝐴 (𝐹‘𝑦) = (𝐺‘〈𝑦, (𝐹 ↾ pred(𝑦, 𝐴, 𝑅))〉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1481 = wceq 1483 ∈ wcel 1990 ∀wral 2912 〈cop 4183 ↾ cres 5116 ‘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-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-xp 5120 df-res 5126 df-iota 5851 df-fv 5896 df-bnj14 30755 |
This theorem is referenced by: bnj1523 31139 |
Copyright terms: Public domain | W3C validator |