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

Theorem no2inds 27965
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 2739 . 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 27964 1 ((𝐴 No 𝐵 No ) → 𝜂)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1092   = wceq 1547  wcel 2119  wral 3053  cun 3881  {copab 5134  cfv 6485   No csur 27621   L cleft 27835   R cright 27836
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-tp 4560  df-op 4562  df-uni 4839  df-int 4878  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-se 5572  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  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 27624  df-lts 27625  df-bday 27626  df-slts 27768  df-cuts 27770  df-made 27837  df-old 27838  df-left 27840  df-right 27841
This theorem is referenced by:  addscom  27976  addbday  28028  mulscom  28149
  Copyright terms: Public domain W3C validator