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

Theorem no2inds 27823
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 2726 . 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 27822 1 ((𝐴 No 𝐵 No ) → 𝜂)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  w3a 1084   = wceq 1533  wcel 2098  wral 3055  cun 3941  {copab 5203  cfv 6536   No csur 27524   L cleft 27723   R cright 27724
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-rep 5278  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420  ax-un 7721
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rmo 3370  df-reu 3371  df-rab 3427  df-v 3470  df-sbc 3773  df-csb 3889  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-pss 3962  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-tp 4628  df-op 4630  df-uni 4903  df-int 4944  df-iun 4992  df-br 5142  df-opab 5204  df-mpt 5225  df-tr 5259  df-id 5567  df-eprel 5573  df-po 5581  df-so 5582  df-fr 5624  df-se 5625  df-we 5626  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-pred 6293  df-ord 6360  df-on 6361  df-suc 6363  df-iota 6488  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7360  df-ov 7407  df-oprab 7408  df-mpo 7409  df-1st 7971  df-2nd 7972  df-frecs 8264  df-wrecs 8295  df-recs 8369  df-1o 8464  df-2o 8465  df-no 27527  df-slt 27528  df-bday 27529  df-sslt 27665  df-scut 27667  df-made 27725  df-old 27726  df-left 27728  df-right 27729
This theorem is referenced by:  addscom  27834  mulscom  27990
  Copyright terms: Public domain W3C validator