| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > noetainflem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for noeta 28100. 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 28075 | . . . 4 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ V) → 𝑇 ∈ No) |
| 4 | 3 | 3adant1 1148 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ⊆ No ∧ 𝐵 ∈ V) → 𝑇 ∈ No) |
| 5 | bdayimaon 28050 | . . . 4 ⊢ (𝐴 ∈ V → suc ∪ (bday “ 𝐴) ∈ On) | |
| 6 | 5 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ⊆ No ∧ 𝐵 ∈ V) → suc ∪ (bday “ 𝐴) ∈ On) |
| 7 | 2oex 8488 | . . . . 5 ⊢ 2o ∈ V | |
| 8 | 7 | prid2 4723 | . . . 4 ⊢ 2o ∈ {1o, 2o} |
| 9 | 8 | noextendseq 28024 | . . 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 1569 ∈ wcel 2144 {cab 2738 ∀wral 3076 ∃wrex 3086 Vcvv 3450 ⊆ wss 3895 ∖ cdif 4045 ∪ cun 4149 ifcif 4481 {csn 4583 〈cop 4589 ∪ cuni 4866 class class class wbr 5102 ↦ cmpt 5185 × cxp 5648 dom cdm 5650 ↾ cres 5652 “ cima 5653 Oncon0 6362 suc csuc 6364 ℩cio 6492 ‘cfv 6538 ℩crio 7376 1oc1o 8469 2oc2o 8470 Nocsur 27997 <s clts 27998 bdaycbday 27999 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-tp 4588 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-ord 6365 df-on 6366 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fo 6544 df-fv 6546 df-riota 7377 df-1o 8476 df-2o 8477 df-no 28000 df-lts 28001 df-bday 28002 |
| This theorem is used by: noetainflem3 28096 noetainflem4 28097 noetalem1 28098 |
| Copyright terms: Public domain | W3C validator |