| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > noetainflem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for noeta 28127. 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 28102 | . . . 4 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ V) → 𝑇 ∈ No) |
| 4 | 3 | 3adant1 1148 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ⊆ No ∧ 𝐵 ∈ V) → 𝑇 ∈ No) |
| 5 | bdayimaon 28077 | . . . 4 ⊢ (𝐴 ∈ V → suc ∪ (bday “ 𝐴) ∈ On) | |
| 6 | 5 | 3ad2ant1 1151 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ⊆ No ∧ 𝐵 ∈ V) → suc ∪ (bday “ 𝐴) ∈ On) |
| 7 | 2oex 8513 | . . . . 5 ⊢ 2o ∈ V | |
| 8 | 7 | prid2 4724 | . . . 4 ⊢ 2o ∈ {1o, 2o} |
| 9 | 8 | noextendseq 28051 | . . 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 2868 | 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 2147 {cab 2741 ∀wral 3080 ∃wrex 3090 Vcvv 3454 ⊆ wss 3900 ∖ cdif 4048 ∪ cun 4152 ifcif 4485 {csn 4588 〈cop 4838 ∪ cuni 4870 class class class wbr 5106 ↦ cmpt 5189 × cxp 5653 dom cdm 5655 ↾ cres 5657 “ cima 5658 Oncon0 6377 suc csuc 6379 ℩cio 6507 ‘cfv 6555 ℩crio 7396 1oc1o 8494 2oc2o 8495 Nocsur 28024 <s clts 28025 bdaycbday 28026 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-ord 6380 df-on 6381 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-fo 6561 df-fv 6563 df-riota 7397 df-1o 8501 df-2o 8502 df-no 28027 df-lts 28028 df-bday 28029 |
| This theorem is used by: noetainflem3 28123 noetainflem4 28124 noetalem1 28125 |
| Copyright terms: Public domain | W3C validator |