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

Theorem no2indslem 27861
Description: Double induction on surreals with explicit notation for the relationships. (Contributed by Scott Fenton, 22-Aug-2024.)
Hypotheses
Ref Expression
no2indslem.a 𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))}
no2indslem.1 (𝑥 = 𝑧 → (𝜑𝜓))
no2indslem.2 (𝑦 = 𝑤 → (𝜓𝜒))
no2indslem.3 (𝑥 = 𝑧 → (𝜃𝜒))
no2indslem.4 (𝑥 = 𝐴 → (𝜑𝜏))
no2indslem.5 (𝑦 = 𝐵 → (𝜏𝜂))
no2indslem.i ((𝑥 No 𝑦 No ) → ((∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒 ∧ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))𝜓 ∧ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜃) → 𝜑))
Assertion
Ref Expression
no2indslem ((𝐴 No 𝐵 No ) → 𝜂)
Distinct variable groups:   𝑎,𝑏,𝑥   𝑥,𝐴   𝑦,𝑎   𝑦,𝐴   𝑥,𝑏,𝑦   𝑦,𝐵   𝜒,𝑦   𝜂,𝑦   𝜑,𝑧   𝜓,𝑤,𝑥   𝑥,𝑅,𝑦,𝑤,𝑧   𝜏,𝑥   𝜃,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑤,𝑎,𝑏)   𝜓(𝑦,𝑧,𝑎,𝑏)   𝜒(𝑥,𝑧,𝑤,𝑎,𝑏)   𝜃(𝑥,𝑦,𝑤,𝑎,𝑏)   𝜏(𝑦,𝑧,𝑤,𝑎,𝑏)   𝜂(𝑥,𝑧,𝑤,𝑎,𝑏)   𝐴(𝑧,𝑤,𝑎,𝑏)   𝐵(𝑥,𝑧,𝑤,𝑎,𝑏)   𝑅(𝑎,𝑏)

Proof of Theorem no2indslem
StepHypRef Expression
1 no2indslem.a . . 3 𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))}
21lrrecfr 27850 . 2 𝑅 Fr No
31lrrecpo 27848 . 2 𝑅 Po No
41lrrecse 27849 . 2 𝑅 Se No
5 no2indslem.1 . 2 (𝑥 = 𝑧 → (𝜑𝜓))
6 no2indslem.2 . 2 (𝑦 = 𝑤 → (𝜓𝜒))
7 no2indslem.3 . 2 (𝑥 = 𝑧 → (𝜃𝜒))
8 no2indslem.4 . 2 (𝑥 = 𝐴 → (𝜑𝜏))
9 no2indslem.5 . 2 (𝑦 = 𝐵 → (𝜏𝜂))
101lrrecpred 27851 . . . . . 6 (𝑥 No → Pred(𝑅, No , 𝑥) = (( L ‘𝑥) ∪ ( R ‘𝑥)))
1110adantr 480 . . . . 5 ((𝑥 No 𝑦 No ) → Pred(𝑅, No , 𝑥) = (( L ‘𝑥) ∪ ( R ‘𝑥)))
121lrrecpred 27851 . . . . . . 7 (𝑦 No → Pred(𝑅, No , 𝑦) = (( L ‘𝑦) ∪ ( R ‘𝑦)))
1312adantl 481 . . . . . 6 ((𝑥 No 𝑦 No ) → Pred(𝑅, No , 𝑦) = (( L ‘𝑦) ∪ ( R ‘𝑦)))
1413raleqdv 3299 . . . . 5 ((𝑥 No 𝑦 No ) → (∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜒 ↔ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒))
1511, 14raleqbidv 3319 . . . 4 ((𝑥 No 𝑦 No ) → (∀𝑧 ∈ Pred (𝑅, No , 𝑥)∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜒 ↔ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒))
1611raleqdv 3299 . . . 4 ((𝑥 No 𝑦 No ) → (∀𝑧 ∈ Pred (𝑅, No , 𝑥)𝜓 ↔ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))𝜓))
1713raleqdv 3299 . . . 4 ((𝑥 No 𝑦 No ) → (∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜃 ↔ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜃))
1815, 16, 173anbi123d 1438 . . 3 ((𝑥 No 𝑦 No ) → ((∀𝑧 ∈ Pred (𝑅, No , 𝑥)∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜒 ∧ ∀𝑧 ∈ Pred (𝑅, No , 𝑥)𝜓 ∧ ∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜃) ↔ (∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒 ∧ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))𝜓 ∧ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜃)))
19 no2indslem.i . . 3 ((𝑥 No 𝑦 No ) → ((∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒 ∧ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))𝜓 ∧ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜃) → 𝜑))
2018, 19sylbid 240 . 2 ((𝑥 No 𝑦 No ) → ((∀𝑧 ∈ Pred (𝑅, No , 𝑥)∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜒 ∧ ∀𝑧 ∈ Pred (𝑅, No , 𝑥)𝜓 ∧ ∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜃) → 𝜑))
212, 3, 4, 2, 3, 4, 5, 6, 7, 8, 9, 20xpord2ind 8127 1 ((𝐴 No 𝐵 No ) → 𝜂)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2109  wral 3044  cun 3912  {copab 5169  Predcpred 6273  cfv 6511   No csur 27551   L cleft 27753   R cright 27754
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-se 5592  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-1o 8434  df-2o 8435  df-no 27554  df-slt 27555  df-bday 27556  df-sslt 27693  df-scut 27695  df-made 27755  df-old 27756  df-left 27758  df-right 27759
This theorem is referenced by:  no2inds  27862
  Copyright terms: Public domain W3C validator