| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > noetainflem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for noeta 28019. Establish that this particular construction gives a surreal. (Contributed by Scott Fenton, 9-Aug-2024.) |
| Ref | Expression |
|---|---|
| noetainflem.1 | ⊢ 𝑇 = if(∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥, ((℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥) ∪ {〈dom (℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥), 1o〉}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥)))) |
| noetainflem.2 | ⊢ 𝑊 = (𝑇 ∪ ((suc ∪ ( bday “ 𝐴) ∖ dom 𝑇) × {2o})) |
| Ref | Expression |
|---|---|
| noetainflem1 | ⊢ ((𝐴 ∈ V ∧ 𝐵 ⊆ No ∧ 𝐵 ∈ V) → 𝑊 ∈ No ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | noetainflem.2 | . 2 ⊢ 𝑊 = (𝑇 ∪ ((suc ∪ ( bday “ 𝐴) ∖ dom 𝑇) × {2o})) | |
| 2 | noetainflem.1 | . . . . 5 ⊢ 𝑇 = if(∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥, ((℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥) ∪ {〈dom (℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥), 1o〉}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥)))) | |
| 3 | 2 | noinfno 27994 | . . . 4 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ V) → 𝑇 ∈ No ) |
| 4 | 3 | 3adant1 1148 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ⊆ No ∧ 𝐵 ∈ V) → 𝑇 ∈ No ) |
| 5 | bdayimaon 27969 | . . . 4 ⊢ (𝐴 ∈ V → suc ∪ ( bday “ 𝐴) ∈ On) | |
| 6 | 5 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ⊆ No ∧ 𝐵 ∈ V) → suc ∪ ( bday “ 𝐴) ∈ On) |
| 7 | 2oex 8467 | . . . . 5 ⊢ 2o ∈ V | |
| 8 | 7 | prid2 4724 | . . . 4 ⊢ 2o ∈ {1o, 2o} |
| 9 | 8 | noextendseq 27943 | . . 3 ⊢ ((𝑇 ∈ No ∧ suc ∪ ( bday “ 𝐴) ∈ On) → (𝑇 ∪ ((suc ∪ ( bday “ 𝐴) ∖ dom 𝑇) × {2o})) ∈ No ) |
| 10 | 4, 6, 9 | syl2anc 596 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ⊆ No ∧ 𝐵 ∈ V) → (𝑇 ∪ ((suc ∪ ( bday “ 𝐴) ∖ dom 𝑇) × {2o})) ∈ No ) |
| 11 | 1, 10 | eqeltrid 2864 | 1 ⊢ ((𝐴 ∈ V ∧ 𝐵 ⊆ No ∧ 𝐵 ∈ V) → 𝑊 ∈ No ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 {cab 2738 ∀wral 3076 ∃wrex 3086 Vcvv 3450 ∖ cdif 3896 ∪ cun 3897 ⊆ wss 3899 ifcif 4482 {csn 4584 〈cop 4590 ∪ cuni 4867 class class class wbr 5103 ↦ cmpt 5186 × cxp 5646 dom cdm 5648 ↾ cres 5650 “ cima 5651 Oncon0 6352 suc csuc 6354 ℩cio 6482 ‘cfv 6528 ℩crio 7365 1oc1o 8448 2oc2o 8449 No csur 27916 <s clts 27917 bday cbday 27918 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-ord 6355 df-on 6356 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-fo 6534 df-fv 6536 df-riota 7366 df-1o 8455 df-2o 8456 df-no 27919 df-lts 27920 df-bday 27921 |
| This theorem is used by: noetainflem3 28015 noetainflem4 28016 noetalem1 28017 |
| Copyright terms: Public domain | W3C validator |