![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ennnfonelemhdmp1 | GIF version |
Description: Lemma for ennnfone 11974. Domain at a successor where we need to add an element to the sequence. (Contributed by Jim Kingdon, 23-Jul-2023.) |
Ref | Expression |
---|---|
ennnfonelemh.dceq | ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦) |
ennnfonelemh.f | ⊢ (𝜑 → 𝐹:ω–onto→𝐴) |
ennnfonelemh.ne | ⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗)) |
ennnfonelemh.g | ⊢ 𝐺 = (𝑥 ∈ (𝐴 ↑pm ω), 𝑦 ∈ ω ↦ if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {〈dom 𝑥, (𝐹‘𝑦)〉}))) |
ennnfonelemh.n | ⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) |
ennnfonelemh.j | ⊢ 𝐽 = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, ∅, (◡𝑁‘(𝑥 − 1)))) |
ennnfonelemh.h | ⊢ 𝐻 = seq0(𝐺, 𝐽) |
ennnfonelemhdmp1.p | ⊢ (𝜑 → 𝑃 ∈ ℕ0) |
ennnfonelemhdmp1.nel | ⊢ (𝜑 → ¬ (𝐹‘(◡𝑁‘𝑃)) ∈ (𝐹 “ (◡𝑁‘𝑃))) |
Ref | Expression |
---|---|
ennnfonelemhdmp1 | ⊢ (𝜑 → dom (𝐻‘(𝑃 + 1)) = suc dom (𝐻‘𝑃)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ennnfonelemh.dceq | . . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦) | |
2 | ennnfonelemh.f | . . . . . . 7 ⊢ (𝜑 → 𝐹:ω–onto→𝐴) | |
3 | ennnfonelemh.ne | . . . . . . 7 ⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗)) | |
4 | ennnfonelemh.g | . . . . . . 7 ⊢ 𝐺 = (𝑥 ∈ (𝐴 ↑pm ω), 𝑦 ∈ ω ↦ if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {〈dom 𝑥, (𝐹‘𝑦)〉}))) | |
5 | ennnfonelemh.n | . . . . . . 7 ⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) | |
6 | ennnfonelemh.j | . . . . . . 7 ⊢ 𝐽 = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, ∅, (◡𝑁‘(𝑥 − 1)))) | |
7 | ennnfonelemh.h | . . . . . . 7 ⊢ 𝐻 = seq0(𝐺, 𝐽) | |
8 | ennnfonelemhdmp1.p | . . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ ℕ0) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | ennnfonelemp1 11955 | . . . . . 6 ⊢ (𝜑 → (𝐻‘(𝑃 + 1)) = if((𝐹‘(◡𝑁‘𝑃)) ∈ (𝐹 “ (◡𝑁‘𝑃)), (𝐻‘𝑃), ((𝐻‘𝑃) ∪ {〈dom (𝐻‘𝑃), (𝐹‘(◡𝑁‘𝑃))〉}))) |
10 | ennnfonelemhdmp1.nel | . . . . . . 7 ⊢ (𝜑 → ¬ (𝐹‘(◡𝑁‘𝑃)) ∈ (𝐹 “ (◡𝑁‘𝑃))) | |
11 | 10 | iffalsed 3489 | . . . . . 6 ⊢ (𝜑 → if((𝐹‘(◡𝑁‘𝑃)) ∈ (𝐹 “ (◡𝑁‘𝑃)), (𝐻‘𝑃), ((𝐻‘𝑃) ∪ {〈dom (𝐻‘𝑃), (𝐹‘(◡𝑁‘𝑃))〉})) = ((𝐻‘𝑃) ∪ {〈dom (𝐻‘𝑃), (𝐹‘(◡𝑁‘𝑃))〉})) |
12 | 9, 11 | eqtrd 2173 | . . . . 5 ⊢ (𝜑 → (𝐻‘(𝑃 + 1)) = ((𝐻‘𝑃) ∪ {〈dom (𝐻‘𝑃), (𝐹‘(◡𝑁‘𝑃))〉})) |
13 | 12 | dmeqd 4749 | . . . 4 ⊢ (𝜑 → dom (𝐻‘(𝑃 + 1)) = dom ((𝐻‘𝑃) ∪ {〈dom (𝐻‘𝑃), (𝐹‘(◡𝑁‘𝑃))〉})) |
14 | dmun 4754 | . . . 4 ⊢ dom ((𝐻‘𝑃) ∪ {〈dom (𝐻‘𝑃), (𝐹‘(◡𝑁‘𝑃))〉}) = (dom (𝐻‘𝑃) ∪ dom {〈dom (𝐻‘𝑃), (𝐹‘(◡𝑁‘𝑃))〉}) | |
15 | 13, 14 | eqtrdi 2189 | . . 3 ⊢ (𝜑 → dom (𝐻‘(𝑃 + 1)) = (dom (𝐻‘𝑃) ∪ dom {〈dom (𝐻‘𝑃), (𝐹‘(◡𝑁‘𝑃))〉})) |
16 | fof 5353 | . . . . . . 7 ⊢ (𝐹:ω–onto→𝐴 → 𝐹:ω⟶𝐴) | |
17 | 2, 16 | syl 14 | . . . . . 6 ⊢ (𝜑 → 𝐹:ω⟶𝐴) |
18 | 5 | frechashgf1o 10232 | . . . . . . . . 9 ⊢ 𝑁:ω–1-1-onto→ℕ0 |
19 | f1ocnv 5388 | . . . . . . . . 9 ⊢ (𝑁:ω–1-1-onto→ℕ0 → ◡𝑁:ℕ0–1-1-onto→ω) | |
20 | f1of 5375 | . . . . . . . . 9 ⊢ (◡𝑁:ℕ0–1-1-onto→ω → ◡𝑁:ℕ0⟶ω) | |
21 | 18, 19, 20 | mp2b 8 | . . . . . . . 8 ⊢ ◡𝑁:ℕ0⟶ω |
22 | 21 | a1i 9 | . . . . . . 7 ⊢ (𝜑 → ◡𝑁:ℕ0⟶ω) |
23 | 22, 8 | ffvelrnd 5564 | . . . . . 6 ⊢ (𝜑 → (◡𝑁‘𝑃) ∈ ω) |
24 | 17, 23 | ffvelrnd 5564 | . . . . 5 ⊢ (𝜑 → (𝐹‘(◡𝑁‘𝑃)) ∈ 𝐴) |
25 | dmsnopg 5018 | . . . . 5 ⊢ ((𝐹‘(◡𝑁‘𝑃)) ∈ 𝐴 → dom {〈dom (𝐻‘𝑃), (𝐹‘(◡𝑁‘𝑃))〉} = {dom (𝐻‘𝑃)}) | |
26 | 24, 25 | syl 14 | . . . 4 ⊢ (𝜑 → dom {〈dom (𝐻‘𝑃), (𝐹‘(◡𝑁‘𝑃))〉} = {dom (𝐻‘𝑃)}) |
27 | 26 | uneq2d 3235 | . . 3 ⊢ (𝜑 → (dom (𝐻‘𝑃) ∪ dom {〈dom (𝐻‘𝑃), (𝐹‘(◡𝑁‘𝑃))〉}) = (dom (𝐻‘𝑃) ∪ {dom (𝐻‘𝑃)})) |
28 | 15, 27 | eqtrd 2173 | . 2 ⊢ (𝜑 → dom (𝐻‘(𝑃 + 1)) = (dom (𝐻‘𝑃) ∪ {dom (𝐻‘𝑃)})) |
29 | df-suc 4301 | . 2 ⊢ suc dom (𝐻‘𝑃) = (dom (𝐻‘𝑃) ∪ {dom (𝐻‘𝑃)}) | |
30 | 28, 29 | eqtr4di 2191 | 1 ⊢ (𝜑 → dom (𝐻‘(𝑃 + 1)) = suc dom (𝐻‘𝑃)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 DECID wdc 820 = wceq 1332 ∈ wcel 1481 ≠ wne 2309 ∀wral 2417 ∃wrex 2418 ∪ cun 3074 ∅c0 3368 ifcif 3479 {csn 3532 〈cop 3535 ↦ cmpt 3997 suc csuc 4295 ωcom 4512 ◡ccnv 4546 dom cdm 4547 “ cima 4550 ⟶wf 5127 –onto→wfo 5129 –1-1-onto→wf1o 5130 ‘cfv 5131 (class class class)co 5782 ∈ cmpo 5784 freccfrec 6295 ↑pm cpm 6551 0cc0 7644 1c1 7645 + caddc 7647 − cmin 7957 ℕ0cn0 9001 ℤcz 9078 seqcseq 10249 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-coll 4051 ax-sep 4054 ax-nul 4062 ax-pow 4106 ax-pr 4139 ax-un 4363 ax-setind 4460 ax-iinf 4510 ax-cnex 7735 ax-resscn 7736 ax-1cn 7737 ax-1re 7738 ax-icn 7739 ax-addcl 7740 ax-addrcl 7741 ax-mulcl 7742 ax-addcom 7744 ax-addass 7746 ax-distr 7748 ax-i2m1 7749 ax-0lt1 7750 ax-0id 7752 ax-rnegex 7753 ax-cnre 7755 ax-pre-ltirr 7756 ax-pre-ltwlin 7757 ax-pre-lttrn 7758 ax-pre-ltadd 7760 |
This theorem depends on definitions: df-bi 116 df-dc 821 df-3or 964 df-3an 965 df-tru 1335 df-fal 1338 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-nel 2405 df-ral 2422 df-rex 2423 df-reu 2424 df-rab 2426 df-v 2691 df-sbc 2914 df-csb 3008 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-nul 3369 df-if 3480 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-int 3780 df-iun 3823 df-br 3938 df-opab 3998 df-mpt 3999 df-tr 4035 df-id 4223 df-iord 4296 df-on 4298 df-ilim 4299 df-suc 4301 df-iom 4513 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-rn 4558 df-res 4559 df-ima 4560 df-iota 5096 df-fun 5133 df-fn 5134 df-f 5135 df-f1 5136 df-fo 5137 df-f1o 5138 df-fv 5139 df-riota 5738 df-ov 5785 df-oprab 5786 df-mpo 5787 df-1st 6046 df-2nd 6047 df-recs 6210 df-frec 6296 df-pm 6553 df-pnf 7826 df-mnf 7827 df-xr 7828 df-ltxr 7829 df-le 7830 df-sub 7959 df-neg 7960 df-inn 8745 df-n0 9002 df-z 9079 df-uz 9351 df-seqfrec 10250 |
This theorem is referenced by: ennnfonelemhf1o 11962 |
Copyright terms: Public domain | W3C validator |