Theorem noeta 28100

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 28059	. 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 28074	. 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 28099	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 1569   ∈ wcel 2144  {cab 2738  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895   ∪ cun 4149  ifcif 4481  {csn 4583  ⟨cop 4589   class class class wbr 5102   ↦ cmpt 5185  dom cdm 5650   ↾ cres 5652   “ cima 5653  Oncon0 6362  suc csuc 6364  ℩cio 6492  ‘cfv 6538  ℩crio 7376  1_oc1o 8469  2_oc2o 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-int 4907  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-f1 6543  df-fo 6544  df-f1o 6545  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:  noeta2  28147  etaslts  28179