Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wfrlem13 | Structured version Visualization version GIF version |
Description: Lemma for well-founded recursion. From here through wfrlem16 7973, we aim to prove that dom 𝐹 = 𝐴. We do this by supposing that there is an element 𝑧 of 𝐴 that is not in dom 𝐹. We then define 𝐶 by extending dom 𝐹 with the appropriate value at 𝑧. We then show that 𝑧 cannot be an 𝑅 minimal element of (𝐴 ∖ dom 𝐹), meaning that (𝐴 ∖ dom 𝐹) must be empty, so dom 𝐹 = 𝐴. Here, we show that 𝐶 is a function extending the domain of 𝐹 by one. (Contributed by Scott Fenton, 21-Apr-2011.) (Revised by Mario Carneiro, 26-Jun-2015.) |
Ref | Expression |
---|---|
wfrlem13.1 | ⊢ 𝑅 We 𝐴 |
wfrlem13.2 | ⊢ 𝑅 Se 𝐴 |
wfrlem13.3 | ⊢ 𝐹 = wrecs(𝑅, 𝐴, 𝐺) |
wfrlem13.4 | ⊢ 𝐶 = (𝐹 ∪ {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) |
Ref | Expression |
---|---|
wfrlem13 | ⊢ (𝑧 ∈ (𝐴 ∖ dom 𝐹) → 𝐶 Fn (dom 𝐹 ∪ {𝑧})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wfrlem13.1 | . . . . 5 ⊢ 𝑅 We 𝐴 | |
2 | wfrlem13.2 | . . . . 5 ⊢ 𝑅 Se 𝐴 | |
3 | wfrlem13.3 | . . . . 5 ⊢ 𝐹 = wrecs(𝑅, 𝐴, 𝐺) | |
4 | 1, 2, 3 | wfrfun 7968 | . . . 4 ⊢ Fun 𝐹 |
5 | vex 3500 | . . . . 5 ⊢ 𝑧 ∈ V | |
6 | fvex 6686 | . . . . 5 ⊢ (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧))) ∈ V | |
7 | 5, 6 | funsn 6410 | . . . 4 ⊢ Fun {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉} |
8 | 4, 7 | pm3.2i 473 | . . 3 ⊢ (Fun 𝐹 ∧ Fun {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) |
9 | 6 | dmsnop 6076 | . . . . 5 ⊢ dom {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉} = {𝑧} |
10 | 9 | ineq2i 4189 | . . . 4 ⊢ (dom 𝐹 ∩ dom {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) = (dom 𝐹 ∩ {𝑧}) |
11 | eldifn 4107 | . . . . 5 ⊢ (𝑧 ∈ (𝐴 ∖ dom 𝐹) → ¬ 𝑧 ∈ dom 𝐹) | |
12 | disjsn 4650 | . . . . 5 ⊢ ((dom 𝐹 ∩ {𝑧}) = ∅ ↔ ¬ 𝑧 ∈ dom 𝐹) | |
13 | 11, 12 | sylibr 236 | . . . 4 ⊢ (𝑧 ∈ (𝐴 ∖ dom 𝐹) → (dom 𝐹 ∩ {𝑧}) = ∅) |
14 | 10, 13 | syl5eq 2871 | . . 3 ⊢ (𝑧 ∈ (𝐴 ∖ dom 𝐹) → (dom 𝐹 ∩ dom {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) = ∅) |
15 | funun 6403 | . . 3 ⊢ (((Fun 𝐹 ∧ Fun {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) ∧ (dom 𝐹 ∩ dom {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) = ∅) → Fun (𝐹 ∪ {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉})) | |
16 | 8, 14, 15 | sylancr 589 | . 2 ⊢ (𝑧 ∈ (𝐴 ∖ dom 𝐹) → Fun (𝐹 ∪ {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉})) |
17 | dmun 5782 | . . 3 ⊢ dom (𝐹 ∪ {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) = (dom 𝐹 ∪ dom {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) | |
18 | 9 | uneq2i 4139 | . . 3 ⊢ (dom 𝐹 ∪ dom {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) = (dom 𝐹 ∪ {𝑧}) |
19 | 17, 18 | eqtri 2847 | . 2 ⊢ dom (𝐹 ∪ {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) = (dom 𝐹 ∪ {𝑧}) |
20 | wfrlem13.4 | . . . 4 ⊢ 𝐶 = (𝐹 ∪ {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) | |
21 | 20 | fneq1i 6453 | . . 3 ⊢ (𝐶 Fn (dom 𝐹 ∪ {𝑧}) ↔ (𝐹 ∪ {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) Fn (dom 𝐹 ∪ {𝑧})) |
22 | df-fn 6361 | . . 3 ⊢ ((𝐹 ∪ {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) Fn (dom 𝐹 ∪ {𝑧}) ↔ (Fun (𝐹 ∪ {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) ∧ dom (𝐹 ∪ {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) = (dom 𝐹 ∪ {𝑧}))) | |
23 | 21, 22 | bitri 277 | . 2 ⊢ (𝐶 Fn (dom 𝐹 ∪ {𝑧}) ↔ (Fun (𝐹 ∪ {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) ∧ dom (𝐹 ∪ {〈𝑧, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑧)))〉}) = (dom 𝐹 ∪ {𝑧}))) |
24 | 16, 19, 23 | sylanblrc 592 | 1 ⊢ (𝑧 ∈ (𝐴 ∖ dom 𝐹) → 𝐶 Fn (dom 𝐹 ∪ {𝑧})) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ∖ cdif 3936 ∪ cun 3937 ∩ cin 3938 ∅c0 4294 {csn 4570 〈cop 4576 Se wse 5515 We wwe 5516 dom cdm 5558 ↾ cres 5560 Predcpred 6150 Fun wfun 6352 Fn wfn 6353 ‘cfv 6358 wrecscwrecs 7949 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-po 5477 df-so 5478 df-fr 5517 df-se 5518 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-iota 6317 df-fun 6360 df-fn 6361 df-fv 6366 df-wrecs 7950 |
This theorem is referenced by: wfrlem14 7971 wfrlem15 7972 |
Copyright terms: Public domain | W3C validator |