![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ennnfonelemfun | GIF version |
Description: Lemma for ennnfone 12418. 𝐿 is a function. (Contributed by Jim Kingdon, 16-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(𝐺, 𝐽) |
ennnfone.l | ⊢ 𝐿 = ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖) |
Ref | Expression |
---|---|
ennnfonelemfun | ⊢ (𝜑 → Fun 𝐿) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ennnfonelemh.dceq | . . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦) | |
2 | ennnfonelemh.f | . . . . . . . . 9 ⊢ (𝜑 → 𝐹:ω–onto→𝐴) | |
3 | ennnfonelemh.ne | . . . . . . . . 9 ⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗)) | |
4 | ennnfonelemh.g | . . . . . . . . 9 ⊢ 𝐺 = (𝑥 ∈ (𝐴 ↑pm ω), 𝑦 ∈ ω ↦ if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {〈dom 𝑥, (𝐹‘𝑦)〉}))) | |
5 | ennnfonelemh.n | . . . . . . . . 9 ⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) | |
6 | ennnfonelemh.j | . . . . . . . . 9 ⊢ 𝐽 = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, ∅, (◡𝑁‘(𝑥 − 1)))) | |
7 | ennnfonelemh.h | . . . . . . . . 9 ⊢ 𝐻 = seq0(𝐺, 𝐽) | |
8 | 1, 2, 3, 4, 5, 6, 7 | ennnfonelemh 12397 | . . . . . . . 8 ⊢ (𝜑 → 𝐻:ℕ0⟶(𝐴 ↑pm ω)) |
9 | 8 | frnd 5374 | . . . . . . 7 ⊢ (𝜑 → ran 𝐻 ⊆ (𝐴 ↑pm ω)) |
10 | 9 | sselda 3155 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → 𝑠 ∈ (𝐴 ↑pm ω)) |
11 | pmfun 6665 | . . . . . 6 ⊢ (𝑠 ∈ (𝐴 ↑pm ω) → Fun 𝑠) | |
12 | 10, 11 | syl 14 | . . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → Fun 𝑠) |
13 | 1 | ad2antrr 488 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦) |
14 | 2 | ad2antrr 488 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → 𝐹:ω–onto→𝐴) |
15 | 3 | ad2antrr 488 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗)) |
16 | simplr 528 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → 𝑠 ∈ ran 𝐻) | |
17 | simpr 110 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → 𝑡 ∈ ran 𝐻) | |
18 | 13, 14, 15, 4, 5, 6, 7, 16, 17 | ennnfonelemrnh 12409 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → (𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠)) |
19 | 18 | ralrimiva 2550 | . . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → ∀𝑡 ∈ ran 𝐻(𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠)) |
20 | 12, 19 | jca 306 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → (Fun 𝑠 ∧ ∀𝑡 ∈ ran 𝐻(𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠))) |
21 | 20 | ralrimiva 2550 | . . 3 ⊢ (𝜑 → ∀𝑠 ∈ ran 𝐻(Fun 𝑠 ∧ ∀𝑡 ∈ ran 𝐻(𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠))) |
22 | fununi 5283 | . . 3 ⊢ (∀𝑠 ∈ ran 𝐻(Fun 𝑠 ∧ ∀𝑡 ∈ ran 𝐻(𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠)) → Fun ∪ ran 𝐻) | |
23 | 21, 22 | syl 14 | . 2 ⊢ (𝜑 → Fun ∪ ran 𝐻) |
24 | ennnfone.l | . . . 4 ⊢ 𝐿 = ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖) | |
25 | 8 | ffnd 5365 | . . . . 5 ⊢ (𝜑 → 𝐻 Fn ℕ0) |
26 | fniunfv 5760 | . . . . 5 ⊢ (𝐻 Fn ℕ0 → ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖) = ∪ ran 𝐻) | |
27 | 25, 26 | syl 14 | . . . 4 ⊢ (𝜑 → ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖) = ∪ ran 𝐻) |
28 | 24, 27 | eqtrid 2222 | . . 3 ⊢ (𝜑 → 𝐿 = ∪ ran 𝐻) |
29 | 28 | funeqd 5237 | . 2 ⊢ (𝜑 → (Fun 𝐿 ↔ Fun ∪ ran 𝐻)) |
30 | 23, 29 | mpbird 167 | 1 ⊢ (𝜑 → Fun 𝐿) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∨ wo 708 DECID wdc 834 = wceq 1353 ∈ wcel 2148 ≠ wne 2347 ∀wral 2455 ∃wrex 2456 ∪ cun 3127 ⊆ wss 3129 ∅c0 3422 ifcif 3534 {csn 3592 〈cop 3595 ∪ cuni 3809 ∪ ciun 3886 ↦ cmpt 4063 suc csuc 4364 ωcom 4588 ◡ccnv 4624 dom cdm 4625 ran crn 4626 “ cima 4628 Fun wfun 5209 Fn wfn 5210 –onto→wfo 5213 ‘cfv 5215 (class class class)co 5872 ∈ cmpo 5874 freccfrec 6388 ↑pm cpm 6646 0cc0 7808 1c1 7809 + caddc 7811 − cmin 8124 ℕ0cn0 9172 ℤcz 9249 seqcseq 10440 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4117 ax-sep 4120 ax-nul 4128 ax-pow 4173 ax-pr 4208 ax-un 4432 ax-setind 4535 ax-iinf 4586 ax-cnex 7899 ax-resscn 7900 ax-1cn 7901 ax-1re 7902 ax-icn 7903 ax-addcl 7904 ax-addrcl 7905 ax-mulcl 7906 ax-addcom 7908 ax-addass 7910 ax-distr 7912 ax-i2m1 7913 ax-0lt1 7914 ax-0id 7916 ax-rnegex 7917 ax-cnre 7919 ax-pre-ltirr 7920 ax-pre-ltwlin 7921 ax-pre-lttrn 7922 ax-pre-ltadd 7924 |
This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-if 3535 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-int 3845 df-iun 3888 df-br 4003 df-opab 4064 df-mpt 4065 df-tr 4101 df-id 4292 df-iord 4365 df-on 4367 df-ilim 4368 df-suc 4370 df-iom 4589 df-xp 4631 df-rel 4632 df-cnv 4633 df-co 4634 df-dm 4635 df-rn 4636 df-res 4637 df-ima 4638 df-iota 5177 df-fun 5217 df-fn 5218 df-f 5219 df-f1 5220 df-fo 5221 df-f1o 5222 df-fv 5223 df-riota 5828 df-ov 5875 df-oprab 5876 df-mpo 5877 df-1st 6138 df-2nd 6139 df-recs 6303 df-frec 6389 df-pm 6648 df-pnf 7990 df-mnf 7991 df-xr 7992 df-ltxr 7993 df-le 7994 df-sub 8126 df-neg 8127 df-inn 8916 df-n0 9173 df-z 9250 df-uz 9525 df-seqfrec 10441 |
This theorem is referenced by: ennnfonelemf1 12411 |
Copyright terms: Public domain | W3C validator |