![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1519 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj1500 34830. 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 |
---|---|
bnj1519.1 | ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} |
bnj1519.2 | ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
bnj1519.3 | ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} |
bnj1519.4 | ⊢ 𝐹 = ∪ 𝐶 |
Ref | Expression |
---|---|
bnj1519 | ⊢ ((𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) → ∀𝑑(𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1519.4 | . . . . 5 ⊢ 𝐹 = ∪ 𝐶 | |
2 | bnj1519.3 | . . . . . . 7 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} | |
3 | nfre1 3272 | . . . . . . . 8 ⊢ Ⅎ𝑑∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) | |
4 | 3 | nfab 2897 | . . . . . . 7 ⊢ Ⅎ𝑑{𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} |
5 | 2, 4 | nfcxfr 2889 | . . . . . 6 ⊢ Ⅎ𝑑𝐶 |
6 | 5 | nfuni 4916 | . . . . 5 ⊢ Ⅎ𝑑∪ 𝐶 |
7 | 1, 6 | nfcxfr 2889 | . . . 4 ⊢ Ⅎ𝑑𝐹 |
8 | nfcv 2891 | . . . 4 ⊢ Ⅎ𝑑𝑥 | |
9 | 7, 8 | nffv 6906 | . . 3 ⊢ Ⅎ𝑑(𝐹‘𝑥) |
10 | nfcv 2891 | . . . 4 ⊢ Ⅎ𝑑𝐺 | |
11 | nfcv 2891 | . . . . . 6 ⊢ Ⅎ𝑑 pred(𝑥, 𝐴, 𝑅) | |
12 | 7, 11 | nfres 5987 | . . . . 5 ⊢ Ⅎ𝑑(𝐹 ↾ pred(𝑥, 𝐴, 𝑅)) |
13 | 8, 12 | nfop 4891 | . . . 4 ⊢ Ⅎ𝑑〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
14 | 10, 13 | nffv 6906 | . . 3 ⊢ Ⅎ𝑑(𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) |
15 | 9, 14 | nfeq 2905 | . 2 ⊢ Ⅎ𝑑(𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) |
16 | 15 | nf5ri 2183 | 1 ⊢ ((𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) → ∀𝑑(𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 ∀wal 1531 = wceq 1533 {cab 2702 ∀wral 3050 ∃wrex 3059 ⊆ wss 3944 〈cop 4636 ∪ cuni 4909 ↾ cres 5680 Fn wfn 6544 ‘cfv 6549 predc-bnj14 34450 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ral 3051 df-rex 3060 df-rab 3419 df-v 3463 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4323 df-if 4531 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-br 5150 df-opab 5212 df-xp 5684 df-res 5690 df-iota 6501 df-fv 6557 |
This theorem is referenced by: bnj1501 34829 |
Copyright terms: Public domain | W3C validator |