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

Theorem no2inds 28114
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 2769 . 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, 7no2indlesm 28113 1 ((𝐴 No 𝐵 No ) → 𝜂)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101   = wceq 1567  wcel 2149  wral 3085  cun 3911  {copab 5177  cfv 6537   No csur 27770   L cleft 27984   R cright 27985
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-se 5616  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-1o 8453  df-2o 8454  df-no 27773  df-lts 27774  df-bday 27775  df-slts 27917  df-cuts 27919  df-made 27986  df-old 27987  df-left 27989  df-right 27990
This theorem is referenced by:  addscom  28125  addbday  28177  mulscom  28298
  Copyright terms: Public domain W3C validator