Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfwrecsOLD | Structured version Visualization version GIF version |
Description: Obsolete proof of nfwrecs 8194 as of 17-Nov-2024. (New usage is discouraged.) (Proof modification is discouraged.) (Contributed by Scott Fenton, 9-Jun-2018.) |
Ref | Expression |
---|---|
nfwrecsOLD.1 | ⊢ Ⅎ𝑥𝑅 |
nfwrecsOLD.2 | ⊢ Ⅎ𝑥𝐴 |
nfwrecsOLD.3 | ⊢ Ⅎ𝑥𝐹 |
Ref | Expression |
---|---|
nfwrecsOLD | ⊢ Ⅎ𝑥wrecs(𝑅, 𝐴, 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfwrecsOLD 8191 | . 2 ⊢ wrecs(𝑅, 𝐴, 𝐹) = ∪ {𝑓 ∣ ∃𝑦(𝑓 Fn 𝑦 ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑦 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑦) ∧ ∀𝑧 ∈ 𝑦 (𝑓‘𝑧) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑧))))} | |
2 | nfv 1916 | . . . . . 6 ⊢ Ⅎ𝑥 𝑓 Fn 𝑦 | |
3 | nfcv 2904 | . . . . . . . 8 ⊢ Ⅎ𝑥𝑦 | |
4 | nfwrecsOLD.2 | . . . . . . . 8 ⊢ Ⅎ𝑥𝐴 | |
5 | 3, 4 | nfss 3923 | . . . . . . 7 ⊢ Ⅎ𝑥 𝑦 ⊆ 𝐴 |
6 | nfwrecsOLD.1 | . . . . . . . . . 10 ⊢ Ⅎ𝑥𝑅 | |
7 | nfcv 2904 | . . . . . . . . . 10 ⊢ Ⅎ𝑥𝑧 | |
8 | 6, 4, 7 | nfpred 6237 | . . . . . . . . 9 ⊢ Ⅎ𝑥Pred(𝑅, 𝐴, 𝑧) |
9 | 8, 3 | nfss 3923 | . . . . . . . 8 ⊢ Ⅎ𝑥Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑦 |
10 | 3, 9 | nfralw 3290 | . . . . . . 7 ⊢ Ⅎ𝑥∀𝑧 ∈ 𝑦 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑦 |
11 | 5, 10 | nfan 1901 | . . . . . 6 ⊢ Ⅎ𝑥(𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑦 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑦) |
12 | nfwrecsOLD.3 | . . . . . . . . 9 ⊢ Ⅎ𝑥𝐹 | |
13 | nfcv 2904 | . . . . . . . . . 10 ⊢ Ⅎ𝑥𝑓 | |
14 | 13, 8 | nfres 5919 | . . . . . . . . 9 ⊢ Ⅎ𝑥(𝑓 ↾ Pred(𝑅, 𝐴, 𝑧)) |
15 | 12, 14 | nffv 6829 | . . . . . . . 8 ⊢ Ⅎ𝑥(𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑧))) |
16 | 15 | nfeq2 2921 | . . . . . . 7 ⊢ Ⅎ𝑥(𝑓‘𝑧) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑧))) |
17 | 3, 16 | nfralw 3290 | . . . . . 6 ⊢ Ⅎ𝑥∀𝑧 ∈ 𝑦 (𝑓‘𝑧) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑧))) |
18 | 2, 11, 17 | nf3an 1903 | . . . . 5 ⊢ Ⅎ𝑥(𝑓 Fn 𝑦 ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑦 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑦) ∧ ∀𝑧 ∈ 𝑦 (𝑓‘𝑧) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑧)))) |
19 | 18 | nfex 2317 | . . . 4 ⊢ Ⅎ𝑥∃𝑦(𝑓 Fn 𝑦 ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑦 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑦) ∧ ∀𝑧 ∈ 𝑦 (𝑓‘𝑧) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑧)))) |
20 | 19 | nfab 2910 | . . 3 ⊢ Ⅎ𝑥{𝑓 ∣ ∃𝑦(𝑓 Fn 𝑦 ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑦 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑦) ∧ ∀𝑧 ∈ 𝑦 (𝑓‘𝑧) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑧))))} |
21 | 20 | nfuni 4858 | . 2 ⊢ Ⅎ𝑥∪ {𝑓 ∣ ∃𝑦(𝑓 Fn 𝑦 ∧ (𝑦 ⊆ 𝐴 ∧ ∀𝑧 ∈ 𝑦 Pred(𝑅, 𝐴, 𝑧) ⊆ 𝑦) ∧ ∀𝑧 ∈ 𝑦 (𝑓‘𝑧) = (𝐹‘(𝑓 ↾ Pred(𝑅, 𝐴, 𝑧))))} |
22 | 1, 21 | nfcxfr 2902 | 1 ⊢ Ⅎ𝑥wrecs(𝑅, 𝐴, 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 396 ∧ w3a 1086 = wceq 1540 ∃wex 1780 {cab 2713 Ⅎwnfc 2884 ∀wral 3061 ⊆ wss 3897 ∪ cuni 4851 ↾ cres 5616 Predcpred 6231 Fn wfn 6468 ‘cfv 6473 wrecscwrecs 8189 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-sep 5240 ax-nul 5247 ax-pr 5369 ax-un 7642 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3404 df-v 3443 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4269 df-if 4473 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4852 df-br 5090 df-opab 5152 df-mpt 5173 df-id 5512 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6232 df-iota 6425 df-fun 6475 df-fn 6476 df-f 6477 df-fo 6479 df-fv 6481 df-ov 7332 df-2nd 7892 df-frecs 8159 df-wrecs 8190 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |