| 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 35765. 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 3291 | . . . . . . . 8 ⊢ Ⅎ𝑑∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) | |
| 4 | 3 | nfab 2932 | . . . . . . 7 ⊢ Ⅎ𝑑{𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} |
| 5 | 2, 4 | nfcxfr 2924 | . . . . . 6 ⊢ Ⅎ𝑑𝐶 |
| 6 | 5 | nfuni 4877 | . . . . 5 ⊢ Ⅎ𝑑∪ 𝐶 |
| 7 | 1, 6 | nfcxfr 2924 | . . . 4 ⊢ Ⅎ𝑑𝐹 |
| 8 | nfcv 2926 | . . . 4 ⊢ Ⅎ𝑑𝑥 | |
| 9 | 7, 8 | nffv 6915 | . . 3 ⊢ Ⅎ𝑑(𝐹‘𝑥) |
| 10 | nfcv 2926 | . . . 4 ⊢ Ⅎ𝑑𝐺 | |
| 11 | nfcv 2926 | . . . . . 6 ⊢ Ⅎ𝑑 pred(𝑥, 𝐴, 𝑅) | |
| 12 | 7, 11 | nfres 5982 | . . . . 5 ⊢ Ⅎ𝑑(𝐹 ↾ pred(𝑥, 𝐴, 𝑅)) |
| 13 | 8, 12 | nfop 4852 | . . . 4 ⊢ Ⅎ𝑑〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
| 14 | 10, 13 | nffv 6915 | . . 3 ⊢ Ⅎ𝑑(𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) |
| 15 | 9, 14 | nfeq 2939 | . 2 ⊢ Ⅎ𝑑(𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) |
| 16 | 15 | nf5ri 2235 | 1 ⊢ ((𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) → ∀𝑑(𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∀wal 1568 = wceq 1570 {cab 2741 ∀wral 3080 ∃wrex 3090 ⊆ wss 3900 〈cop 4838 ∪ cuni 4870 ↾ cres 5657 Fn wfn 6550 ‘cfv 6555 predc-bnj14 35386 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-xp 5661 df-res 5667 df-iota 6509 df-fv 6563 |
| This theorem is used by: bnj1501 35764 |
| Copyright terms: Public domain | W3C validator |