| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tfrlem13 | Structured version Visualization version GIF version | ||
| Description: Lemma for transfinite recursion. If recs is a set function, then 𝐶 is acceptable, and thus a subset of recs, but dom 𝐶 is bigger than dom recs. This is a contradiction, so recs must be a proper class function. (Contributed by NM, 14-Aug-1994.) (Revised by Mario Carneiro, 14-Nov-2014.) |
| Ref | Expression |
|---|---|
| tfrlem.1 | ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))} |
| Ref | Expression |
|---|---|
| tfrlem13 | ⊢ ¬ recs(𝐹) ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tfrlem.1 | . . . 4 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐹‘(𝑓 ↾ 𝑦)))} | |
| 2 | 1 | tfrlem8 8315 | . . 3 ⊢ Ord dom recs(𝐹) |
| 3 | ordirr 6335 | . . 3 ⊢ (Ord dom recs(𝐹) → ¬ dom recs(𝐹) ∈ dom recs(𝐹)) | |
| 4 | 2, 3 | ax-mp 5 | . 2 ⊢ ¬ dom recs(𝐹) ∈ dom recs(𝐹) |
| 5 | eqid 2736 | . . . . 5 ⊢ (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) = (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) | |
| 6 | 1, 5 | tfrlem12 8320 | . . . 4 ⊢ (recs(𝐹) ∈ V → (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ∈ 𝐴) |
| 7 | elssuni 4894 | . . . . 5 ⊢ ((recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ∈ 𝐴 → (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ⊆ ∪ 𝐴) | |
| 8 | 1 | recsfval 8312 | . . . . 5 ⊢ recs(𝐹) = ∪ 𝐴 |
| 9 | 7, 8 | sseqtrrdi 3975 | . . . 4 ⊢ ((recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ∈ 𝐴 → (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ⊆ recs(𝐹)) |
| 10 | dmss 5851 | . . . 4 ⊢ ((recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ⊆ recs(𝐹) → dom (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ⊆ dom recs(𝐹)) | |
| 11 | 6, 9, 10 | 3syl 18 | . . 3 ⊢ (recs(𝐹) ∈ V → dom (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ⊆ dom recs(𝐹)) |
| 12 | 2 | a1i 11 | . . . . . 6 ⊢ (recs(𝐹) ∈ V → Ord dom recs(𝐹)) |
| 13 | dmexg 7843 | . . . . . 6 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ V) | |
| 14 | elon2 6328 | . . . . . 6 ⊢ (dom recs(𝐹) ∈ On ↔ (Ord dom recs(𝐹) ∧ dom recs(𝐹) ∈ V)) | |
| 15 | 12, 13, 14 | sylanbrc 583 | . . . . 5 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ On) |
| 16 | sucidg 6400 | . . . . 5 ⊢ (dom recs(𝐹) ∈ On → dom recs(𝐹) ∈ suc dom recs(𝐹)) | |
| 17 | 15, 16 | syl 17 | . . . 4 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ suc dom recs(𝐹)) |
| 18 | 1, 5 | tfrlem10 8318 | . . . . 5 ⊢ (dom recs(𝐹) ∈ On → (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) Fn suc dom recs(𝐹)) |
| 19 | fndm 6595 | . . . . 5 ⊢ ((recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) Fn suc dom recs(𝐹) → dom (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) = suc dom recs(𝐹)) | |
| 20 | 15, 18, 19 | 3syl 18 | . . . 4 ⊢ (recs(𝐹) ∈ V → dom (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) = suc dom recs(𝐹)) |
| 21 | 17, 20 | eleqtrrd 2839 | . . 3 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ dom (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉})) |
| 22 | 11, 21 | sseldd 3934 | . 2 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ dom recs(𝐹)) |
| 23 | 4, 22 | mto 197 | 1 ⊢ ¬ recs(𝐹) ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∧ wa 395 = wceq 1541 ∈ wcel 2113 {cab 2714 ∀wral 3051 ∃wrex 3060 Vcvv 3440 ∪ cun 3899 ⊆ wss 3901 {csn 4580 〈cop 4586 ∪ cuni 4863 dom cdm 5624 ↾ cres 5626 Ord word 6316 Oncon0 6317 suc csuc 6319 Fn wfn 6487 ‘cfv 6492 recscrecs 8302 |
| 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 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fo 6498 df-fv 6500 df-ov 7361 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 |
| This theorem is referenced by: tfrlem14 8322 tfrlem15 8323 tfrlem16 8324 tfr2b 8327 |
| Copyright terms: Public domain | W3C validator |