| 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 35632. 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 3287 | . . . . . . . 8 ⊢ Ⅎ𝑑∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) | |
| 4 | 3 | nfab 2928 | . . . . . . 7 ⊢ Ⅎ𝑑{𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} |
| 5 | 2, 4 | nfcxfr 2920 | . . . . . 6 ⊢ Ⅎ𝑑𝐶 |
| 6 | 5 | nfuni 4873 | . . . . 5 ⊢ Ⅎ𝑑∪ 𝐶 |
| 7 | 1, 6 | nfcxfr 2920 | . . . 4 ⊢ Ⅎ𝑑𝐹 |
| 8 | nfcv 2922 | . . . 4 ⊢ Ⅎ𝑑𝑥 | |
| 9 | 7, 8 | nffv 6883 | . . 3 ⊢ Ⅎ𝑑(𝐹‘𝑥) |
| 10 | nfcv 2922 | . . . 4 ⊢ Ⅎ𝑑𝐺 | |
| 11 | nfcv 2922 | . . . . . 6 ⊢ Ⅎ𝑑 pred(𝑥, 𝐴, 𝑅) | |
| 12 | 7, 11 | nfres 5968 | . . . . 5 ⊢ Ⅎ𝑑(𝐹 ↾ pred(𝑥, 𝐴, 𝑅)) |
| 13 | 8, 12 | nfop 4848 | . . . 4 ⊢ Ⅎ𝑑〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
| 14 | 10, 13 | nffv 6883 | . . 3 ⊢ Ⅎ𝑑(𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) |
| 15 | 9, 14 | nfeq 2935 | . 2 ⊢ Ⅎ𝑑(𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) |
| 16 | 15 | nf5ri 2231 | 1 ⊢ ((𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉) → ∀𝑑(𝐹‘𝑥) = (𝐺‘〈𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))〉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∀wal 1568 = wceq 1570 {cab 2738 ∀wral 3076 ∃wrex 3086 ⊆ wss 3898 〈cop 4589 ∪ cuni 4866 ↾ cres 5649 Fn wfn 6522 ‘cfv 6527 predc-bnj14 35253 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 |
| 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 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-xp 5653 df-res 5659 df-iota 6483 df-fv 6535 |
| This theorem is used by: bnj1501 35631 |
| Copyright terms: Public domain | W3C validator |