Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ennnfonelemfun | GIF version |
Description: Lemma for ennnfone 11938. 𝐿 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 11917 | . . . . . . . 8 ⊢ (𝜑 → 𝐻:ℕ0⟶(𝐴 ↑pm ω)) |
9 | 8 | frnd 5282 | . . . . . . 7 ⊢ (𝜑 → ran 𝐻 ⊆ (𝐴 ↑pm ω)) |
10 | 9 | sselda 3097 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → 𝑠 ∈ (𝐴 ↑pm ω)) |
11 | pmfun 6562 | . . . . . 6 ⊢ (𝑠 ∈ (𝐴 ↑pm ω) → Fun 𝑠) | |
12 | 10, 11 | syl 14 | . . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → Fun 𝑠) |
13 | 1 | ad2antrr 479 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦) |
14 | 2 | ad2antrr 479 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → 𝐹:ω–onto→𝐴) |
15 | 3 | ad2antrr 479 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗)) |
16 | simplr 519 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → 𝑠 ∈ ran 𝐻) | |
17 | simpr 109 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → 𝑡 ∈ ran 𝐻) | |
18 | 13, 14, 15, 4, 5, 6, 7, 16, 17 | ennnfonelemrnh 11929 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑠 ∈ ran 𝐻) ∧ 𝑡 ∈ ran 𝐻) → (𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠)) |
19 | 18 | ralrimiva 2505 | . . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → ∀𝑡 ∈ ran 𝐻(𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠)) |
20 | 12, 19 | jca 304 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ ran 𝐻) → (Fun 𝑠 ∧ ∀𝑡 ∈ ran 𝐻(𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠))) |
21 | 20 | ralrimiva 2505 | . . 3 ⊢ (𝜑 → ∀𝑠 ∈ ran 𝐻(Fun 𝑠 ∧ ∀𝑡 ∈ ran 𝐻(𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠))) |
22 | fununi 5191 | . . 3 ⊢ (∀𝑠 ∈ ran 𝐻(Fun 𝑠 ∧ ∀𝑡 ∈ ran 𝐻(𝑠 ⊆ 𝑡 ∨ 𝑡 ⊆ 𝑠)) → Fun ∪ ran 𝐻) | |
23 | 21, 22 | syl 14 | . 2 ⊢ (𝜑 → Fun ∪ ran 𝐻) |
24 | ennnfone.l | . . . 4 ⊢ 𝐿 = ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖) | |
25 | 8 | ffnd 5273 | . . . . 5 ⊢ (𝜑 → 𝐻 Fn ℕ0) |
26 | fniunfv 5663 | . . . . 5 ⊢ (𝐻 Fn ℕ0 → ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖) = ∪ ran 𝐻) | |
27 | 25, 26 | syl 14 | . . . 4 ⊢ (𝜑 → ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖) = ∪ ran 𝐻) |
28 | 24, 27 | syl5eq 2184 | . . 3 ⊢ (𝜑 → 𝐿 = ∪ ran 𝐻) |
29 | 28 | funeqd 5145 | . 2 ⊢ (𝜑 → (Fun 𝐿 ↔ Fun ∪ ran 𝐻)) |
30 | 23, 29 | mpbird 166 | 1 ⊢ (𝜑 → Fun 𝐿) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∨ wo 697 DECID wdc 819 = wceq 1331 ∈ wcel 1480 ≠ wne 2308 ∀wral 2416 ∃wrex 2417 ∪ cun 3069 ⊆ wss 3071 ∅c0 3363 ifcif 3474 {csn 3527 〈cop 3530 ∪ cuni 3736 ∪ ciun 3813 ↦ cmpt 3989 suc csuc 4287 ωcom 4504 ◡ccnv 4538 dom cdm 4539 ran crn 4540 “ cima 4542 Fun wfun 5117 Fn wfn 5118 –onto→wfo 5121 ‘cfv 5123 (class class class)co 5774 ∈ cmpo 5776 freccfrec 6287 ↑pm cpm 6543 0cc0 7620 1c1 7621 + caddc 7623 − cmin 7933 ℕ0cn0 8977 ℤcz 9054 seqcseq 10218 |
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 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-coll 4043 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-iinf 4502 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-addcom 7720 ax-addass 7722 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-0id 7728 ax-rnegex 7729 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-ltadd 7736 |
This theorem depends on definitions: df-bi 116 df-dc 820 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-nul 3364 df-if 3475 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-tr 4027 df-id 4215 df-iord 4288 df-on 4290 df-ilim 4291 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-recs 6202 df-frec 6288 df-pm 6545 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-inn 8721 df-n0 8978 df-z 9055 df-uz 9327 df-seqfrec 10219 |
This theorem is referenced by: ennnfonelemf1 11931 |
Copyright terms: Public domain | W3C validator |