| 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 8430 | . . 3 ⊢ Ord dom recs(𝐹) |
| 3 | ordirr 6406 | . . 3 ⊢ (Ord dom recs(𝐹) → ¬ dom recs(𝐹) ∈ dom recs(𝐹)) | |
| 4 | 2, 3 | ax-mp 5 | . 2 ⊢ ¬ dom recs(𝐹) ∈ dom recs(𝐹) |
| 5 | eqid 2763 | . . . . 5 ⊢ (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) = (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) | |
| 6 | 1, 5 | tfrlem12 8435 | . . . 4 ⊢ (recs(𝐹) ∈ V → (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ∈ 𝐴) |
| 7 | elssuni 4904 | . . . . 5 ⊢ ((recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ∈ 𝐴 → (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ⊆ ∪ 𝐴) | |
| 8 | 1 | recsfval 8426 | . . . . 5 ⊢ recs(𝐹) = ∪ 𝐴 |
| 9 | 7, 8 | sseqtrrdi 3954 | . . . 4 ⊢ ((recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ∈ 𝐴 → (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ⊆ recs(𝐹)) |
| 10 | dmss 5896 | . . . 4 ⊢ ((recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ⊆ recs(𝐹) → dom (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ⊆ dom recs(𝐹)) | |
| 11 | 6, 9, 10 | 3syl 19 | . . 3 ⊢ (recs(𝐹) ∈ V → dom (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) ⊆ dom recs(𝐹)) |
| 12 | 2 | a1i 11 | . . . . . 6 ⊢ (recs(𝐹) ∈ V → Ord dom recs(𝐹)) |
| 13 | dmexg 7947 | . . . . . 6 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ V) | |
| 14 | elon2 6399 | . . . . . 6 ⊢ (dom recs(𝐹) ∈ On ↔ (Ord dom recs(𝐹) ∧ dom recs(𝐹) ∈ V)) | |
| 15 | 12, 13, 14 | sylanbrc 595 | . . . . 5 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ On) |
| 16 | sucidg 6472 | . . . . 5 ⊢ (dom recs(𝐹) ∈ On → dom recs(𝐹) ∈ suc dom recs(𝐹)) | |
| 17 | 15, 16 | syl 18 | . . . 4 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ suc dom recs(𝐹)) |
| 18 | 1, 5 | tfrlem10 8433 | . . . . 5 ⊢ (dom recs(𝐹) ∈ On → (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) Fn suc dom recs(𝐹)) |
| 19 | fndm 6672 | . . . . 5 ⊢ ((recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) Fn suc dom recs(𝐹) → dom (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) = suc dom recs(𝐹)) | |
| 20 | 15, 18, 19 | 3syl 19 | . . . 4 ⊢ (recs(𝐹) ∈ V → dom (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉}) = suc dom recs(𝐹)) |
| 21 | 17, 20 | eleqtrrd 2867 | . . 3 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ dom (recs(𝐹) ∪ {〈dom recs(𝐹), (𝐹‘recs(𝐹))〉})) |
| 22 | 11, 21 | sseldd 3914 | . 2 ⊢ (recs(𝐹) ∈ V → dom recs(𝐹) ∈ dom recs(𝐹)) |
| 23 | 4, 22 | mto 200 | 1 ⊢ ¬ recs(𝐹) ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ∧ wa 401 = wceq 1570 ∈ wcel 2147 {cab 2741 ∀wral 3080 ∃wrex 3090 Vcvv 3454 ⊆ wss 3900 ∪ cun 4152 {csn 4588 〈cop 4840 ∪ cuni 4872 dom cdm 5658 ↾ cres 5660 Ord word 6387 Oncon0 6388 suc csuc 6390 Fn wfn 6561 ‘cfv 6566 recscrecs 8416 |
| 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 ax-sep 5255 ax-nul 5266 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-fo 6572 df-fv 6574 df-ov 7454 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 |
| This theorem is used by: tfrlem14 8437 tfrlem15 8438 tfrlem16 8439 tfr2b 8442 |
| Copyright terms: Public domain | W3C validator |