Theorem noeta 27470

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 2732	. . 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 27429	. 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 2732	. . 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 27444	. 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 27469	1 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 <s 𝑦) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂)) → ∃𝑧 ∈ No (∀𝑥 ∈ 𝐴 𝑥 <s 𝑧 ∧ ∀𝑦 ∈ 𝐵 𝑧 <s 𝑦 ∧ ( bday ‘𝑧) ⊆ 𝑂))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  {cab 2709  ∀wral 3061  ∃wrex 3070   ∪ cun 3946   ⊆ wss 3948  ifcif 4528  {csn 4628  ⟨cop 4634   class class class wbr 5148   ↦ cmpt 5231  dom cdm 5676   ↾ cres 5678   “ cima 5679  Oncon0 6364  suc csuc 6366  ℩cio 6493  ‘cfv 6543  ℩crio 7366  1_oc1o 8461  2_oc2o 8462   No csur 27367   <s cslt 27368   bday cbday 27369

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7727

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-tp 4633  df-op 4635  df-uni 4909  df-int 4951  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-ord 6367  df-on 6368  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7367  df-1o 8468  df-2o 8469  df-no 27370  df-slt 27371  df-bday 27372

This theorem is referenced by:  noeta2  27510  etasslt  27539