Theorem noeta 28011

Description: The full-eta axiom for the surreal numbers. This is the single most important property of the surreals. It says that, given two sets of surreals such that one comes completely before the other, there is a surreal lying strictly between the two. Furthermore, if the birthdays of members of 𝐴 and 𝐵 are strictly bounded above by 𝑂, then 𝑂 non-strictly bounds the separator. Axiom FE of [Alling] p. 185. (Contributed by Scott Fenton, 9-Aug-2024.)

Assertion

Ref	Expression
noeta	⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂)) → ∃𝑧 ∈ No (∀𝑥 ∈ 𝐴 𝑥 <s 𝑧 ∧ ∀𝑦 ∈ 𝐵 𝑧 <s 𝑦 ∧ ( bday ‘𝑧) ⊆ 𝑂))

Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑦,𝐵,𝑧   𝑧,𝑂   𝑥,𝐵

Allowed substitution hints:   𝑂(𝑥, 𝑦)   𝑉(𝑥, 𝑦, 𝑧)   𝑊(𝑥, 𝑦, 𝑧)

Proof of Theorem noeta

Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑒 𝑓 𝑔 𝑗 ℎ 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2760	. . 3 ⊢ if(∃𝑓 ∈ 𝐴 ∀𝑔 ∈ 𝐴 ¬ 𝑓 <s 𝑔, ((℩𝑓 ∈ 𝐴 ∀𝑔 ∈ 𝐴 ¬ 𝑓 <s 𝑔) ∪ {⟨dom (℩𝑓 ∈ 𝐴 ∀𝑔 ∈ 𝐴 ¬ 𝑓 <s 𝑔), 2o⟩}), (ℎ ∈ {𝑔 ∣ ∃𝑗 ∈ 𝐴 (𝑔 ∈ dom 𝑗 ∧ ∀𝑘 ∈ 𝐴 (¬ 𝑘 <s 𝑗 → (𝑗 ↾ suc 𝑔) = (𝑘 ↾ suc 𝑔)))} ↦ (℩𝑓∃𝑗 ∈ 𝐴 (ℎ ∈ dom 𝑗 ∧ ∀𝑘 ∈ 𝐴 (¬ 𝑘 <s 𝑗 → (𝑗 ↾ suc ℎ) = (𝑘 ↾ suc ℎ)) ∧ (𝑗‘ℎ) = 𝑓)))) = if(∃𝑓 ∈ 𝐴 ∀𝑔 ∈ 𝐴 ¬ 𝑓 <s 𝑔, ((℩𝑓 ∈ 𝐴 ∀𝑔 ∈ 𝐴 ¬ 𝑓 <s 𝑔) ∪ {⟨dom (℩𝑓 ∈ 𝐴 ∀𝑔 ∈ 𝐴 ¬ 𝑓 <s 𝑔), 2o⟩}), (ℎ ∈ {𝑔 ∣ ∃𝑗 ∈ 𝐴 (𝑔 ∈ dom 𝑗 ∧ ∀𝑘 ∈ 𝐴 (¬ 𝑘 <s 𝑗 → (𝑗 ↾ suc 𝑔) = (𝑘 ↾ suc 𝑔)))} ↦ (℩𝑓∃𝑗 ∈ 𝐴 (ℎ ∈ dom 𝑗 ∧ ∀𝑘 ∈ 𝐴 (¬ 𝑘 <s 𝑗 → (𝑗 ↾ suc ℎ) = (𝑘 ↾ suc ℎ)) ∧ (𝑗‘ℎ) = 𝑓))))
2	1	nosupcbv 27970	. 2 ⊢ if(∃𝑓 ∈ 𝐴 ∀𝑔 ∈ 𝐴 ¬ 𝑓 <s 𝑔, ((℩𝑓 ∈ 𝐴 ∀𝑔 ∈ 𝐴 ¬ 𝑓 <s 𝑔) ∪ {⟨dom (℩𝑓 ∈ 𝐴 ∀𝑔 ∈ 𝐴 ¬ 𝑓 <s 𝑔), 2o⟩}), (ℎ ∈ {𝑔 ∣ ∃𝑗 ∈ 𝐴 (𝑔 ∈ dom 𝑗 ∧ ∀𝑘 ∈ 𝐴 (¬ 𝑘 <s 𝑗 → (𝑗 ↾ suc 𝑔) = (𝑘 ↾ suc 𝑔)))} ↦ (℩𝑓∃𝑗 ∈ 𝐴 (ℎ ∈ dom 𝑗 ∧ ∀𝑘 ∈ 𝐴 (¬ 𝑘 <s 𝑗 → (𝑗 ↾ suc ℎ) = (𝑘 ↾ suc ℎ)) ∧ (𝑗‘ℎ) = 𝑓)))) = if(∃𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏, ((℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏) ∪ {⟨dom (℩𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ¬ 𝑎 <s 𝑏), 2o⟩}), (𝑐 ∈ {𝑏 ∣ ∃𝑑 ∈ 𝐴 (𝑏 ∈ dom 𝑑 ∧ ∀𝑒 ∈ 𝐴 (¬ 𝑒 <s 𝑑 → (𝑑 ↾ suc 𝑏) = (𝑒 ↾ suc 𝑏)))} ↦ (℩𝑎∃𝑑 ∈ 𝐴 (𝑐 ∈ dom 𝑑 ∧ ∀𝑒 ∈ 𝐴 (¬ 𝑒 <s 𝑑 → (𝑑 ↾ suc 𝑐) = (𝑒 ↾ suc 𝑐)) ∧ (𝑑‘𝑐) = 𝑎))))
3		eqid 2760	. . 3 ⊢ if(∃𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 ¬ 𝑔 <s 𝑓, ((℩𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 ¬ 𝑔 <s 𝑓) ∪ {⟨dom (℩𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 ¬ 𝑔 <s 𝑓), 1o⟩}), (ℎ ∈ {𝑔 ∣ ∃𝑗 ∈ 𝐵 (𝑔 ∈ dom 𝑗 ∧ ∀𝑘 ∈ 𝐵 (¬ 𝑗 <s 𝑘 → (𝑗 ↾ suc 𝑔) = (𝑘 ↾ suc 𝑔)))} ↦ (℩𝑓∃𝑗 ∈ 𝐵 (ℎ ∈ dom 𝑗 ∧ ∀𝑘 ∈ 𝐵 (¬ 𝑗 <s 𝑘 → (𝑗 ↾ suc ℎ) = (𝑘 ↾ suc ℎ)) ∧ (𝑗‘ℎ) = 𝑓)))) = if(∃𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 ¬ 𝑔 <s 𝑓, ((℩𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 ¬ 𝑔 <s 𝑓) ∪ {⟨dom (℩𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 ¬ 𝑔 <s 𝑓), 1o⟩}), (ℎ ∈ {𝑔 ∣ ∃𝑗 ∈ 𝐵 (𝑔 ∈ dom 𝑗 ∧ ∀𝑘 ∈ 𝐵 (¬ 𝑗 <s 𝑘 → (𝑗 ↾ suc 𝑔) = (𝑘 ↾ suc 𝑔)))} ↦ (℩𝑓∃𝑗 ∈ 𝐵 (ℎ ∈ dom 𝑗 ∧ ∀𝑘 ∈ 𝐵 (¬ 𝑗 <s 𝑘 → (𝑗 ↾ suc ℎ) = (𝑘 ↾ suc ℎ)) ∧ (𝑗‘ℎ) = 𝑓))))
4	3	noinfcbv 27985	. 2 ⊢ if(∃𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 ¬ 𝑔 <s 𝑓, ((℩𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 ¬ 𝑔 <s 𝑓) ∪ {⟨dom (℩𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 ¬ 𝑔 <s 𝑓), 1o⟩}), (ℎ ∈ {𝑔 ∣ ∃𝑗 ∈ 𝐵 (𝑔 ∈ dom 𝑗 ∧ ∀𝑘 ∈ 𝐵 (¬ 𝑗 <s 𝑘 → (𝑗 ↾ suc 𝑔) = (𝑘 ↾ suc 𝑔)))} ↦ (℩𝑓∃𝑗 ∈ 𝐵 (ℎ ∈ dom 𝑗 ∧ ∀𝑘 ∈ 𝐵 (¬ 𝑗 <s 𝑘 → (𝑗 ↾ suc ℎ) = (𝑘 ↾ suc ℎ)) ∧ (𝑗‘ℎ) = 𝑓)))) = if(∃𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ¬ 𝑏 <s 𝑎, ((℩𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ¬ 𝑏 <s 𝑎) ∪ {⟨dom (℩𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ¬ 𝑏 <s 𝑎), 1o⟩}), (𝑐 ∈ {𝑏 ∣ ∃𝑑 ∈ 𝐵 (𝑏 ∈ dom 𝑑 ∧ ∀𝑒 ∈ 𝐵 (¬ 𝑑 <s 𝑒 → (𝑑 ↾ suc 𝑏) = (𝑒 ↾ suc 𝑏)))} ↦ (℩𝑎∃𝑑 ∈ 𝐵 (𝑐 ∈ dom 𝑑 ∧ ∀𝑒 ∈ 𝐵 (¬ 𝑑 <s 𝑒 → (𝑑 ↾ suc 𝑐) = (𝑒 ↾ suc 𝑐)) ∧ (𝑑‘𝑐) = 𝑎))))
5	2, 4	noetalem2 28010	1 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂)) → ∃𝑧 ∈ No (∀𝑥 ∈ 𝐴 𝑥 <s 𝑧 ∧ ∀𝑦 ∈ 𝐵 𝑧 <s 𝑦 ∧ ( bday ‘𝑧) ⊆ 𝑂))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {cab 2738  ∀wral 3076  ∃wrex 3086   ∪ cun 3897   ⊆ wss 3899  ifcif 4482  {csn 4584  ⟨cop 4590   class class class wbr 5103   ↦ cmpt 5186  dom cdm 5655   ↾ cres 5657   “ cima 5658  Oncon0 6359  suc csuc 6361  ℩cio 6489  ‘cfv 6535  ℩crio 7372  1_oc1o 8455  2_oc2o 8456   No csur 27908   <s clts 27909   bday cbday 27910

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 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7742

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-int 4908  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  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 6362  df-on 6363  df-suc 6365  df-iota 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-riota 7373  df-1o 8462  df-2o 8463  df-no 27911  df-lts 27912  df-bday 27913

This theorem is used by:  noeta2  28058  etaslts  28090