MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  no2inds Structured version   Visualization version   GIF version

Theorem no2inds 27925
Description: Double induction on surreals. The many substitution instances are to cover all possible cases. (Contributed by Scott Fenton, 22-Aug-2024.)
Hypotheses
Ref Expression
no2inds.1 (𝑥 = 𝑧 → (𝜑𝜓))
no2inds.2 (𝑦 = 𝑤 → (𝜓𝜒))
no2inds.3 (𝑥 = 𝑧 → (𝜃𝜒))
no2inds.4 (𝑥 = 𝐴 → (𝜑𝜏))
no2inds.5 (𝑦 = 𝐵 → (𝜏𝜂))
no2inds.i ((𝑥 No 𝑦 No ) → ((∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒 ∧ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))𝜓 ∧ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜃) → 𝜑))
Assertion
Ref Expression
no2inds ((𝐴 No 𝐵 No ) → 𝜂)
Distinct variable groups:   𝑥,𝐴,𝑦   𝑦,𝐵   𝜒,𝑦   𝜂,𝑦   𝜑,𝑧   𝜓,𝑤,𝑥   𝜏,𝑥   𝜃,𝑧   𝑥,𝑤,𝑦,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑤)   𝜓(𝑦,𝑧)   𝜒(𝑥,𝑧,𝑤)   𝜃(𝑥,𝑦,𝑤)   𝜏(𝑦,𝑧,𝑤)   𝜂(𝑥,𝑧,𝑤)   𝐴(𝑧,𝑤)   𝐵(𝑥,𝑧,𝑤)

Proof of Theorem no2inds
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2734 . 2 {⟨𝑎, 𝑏⟩ ∣ 𝑎 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))} = {⟨𝑎, 𝑏⟩ ∣ 𝑎 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))}
2 no2inds.1 . 2 (𝑥 = 𝑧 → (𝜑𝜓))
3 no2inds.2 . 2 (𝑦 = 𝑤 → (𝜓𝜒))
4 no2inds.3 . 2 (𝑥 = 𝑧 → (𝜃𝜒))
5 no2inds.4 . 2 (𝑥 = 𝐴 → (𝜑𝜏))
6 no2inds.5 . 2 (𝑦 = 𝐵 → (𝜏𝜂))
7 no2inds.i . 2 ((𝑥 No 𝑦 No ) → ((∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒 ∧ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))𝜓 ∧ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜃) → 𝜑))
81, 2, 3, 4, 5, 6, 7no2indslem 27924 1 ((𝐴 No 𝐵 No ) → 𝜂)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wral 3049  cun 3897  {copab 5158  cfv 6490   No csur 27605   L cleft 27813   R cright 27814
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-tp 4583  df-op 4585  df-uni 4862  df-int 4901  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-se 5576  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-1o 8395  df-2o 8396  df-no 27608  df-slt 27609  df-bday 27610  df-sslt 27748  df-scut 27750  df-made 27815  df-old 27816  df-left 27818  df-right 27819
This theorem is referenced by:  addscom  27936  addsbday  27987  mulscom  28108
  Copyright terms: Public domain W3C validator