Theorem no2indslem 27418

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

Step	Hyp	Ref	Expression
1		no2indslem.a	. . 3 ⊢ 𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))}
2	1	lrrecfr 27407	. 2 ⊢ 𝑅 Fr No
3	1	lrrecpo 27405	. 2 ⊢ 𝑅 Po No
4	1	lrrecse 27406	. 2 ⊢ 𝑅 Se No
5		no2indslem.1	. 2 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ 𝜓))
6		no2indslem.2	. 2 ⊢ (𝑦 = 𝑤 → (𝜓 ↔ 𝜒))
7		no2indslem.3	. 2 ⊢ (𝑥 = 𝑧 → (𝜃 ↔ 𝜒))
8		no2indslem.4	. 2 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜏))
9		no2indslem.5	. 2 ⊢ (𝑦 = 𝐵 → (𝜏 ↔ 𝜂))
10	1	lrrecpred 27408	. . . . . 6 ⊢ (𝑥 ∈ No → Pred(𝑅, No , 𝑥) = (( L ‘𝑥) ∪ ( R ‘𝑥)))
11	10	adantr 482	. . . . 5 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → Pred(𝑅, No , 𝑥) = (( L ‘𝑥) ∪ ( R ‘𝑥)))
12	1	lrrecpred 27408	. . . . . . 7 ⊢ (𝑦 ∈ No → Pred(𝑅, No , 𝑦) = (( L ‘𝑦) ∪ ( R ‘𝑦)))
13	12	adantl 483	. . . . . 6 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → Pred(𝑅, No , 𝑦) = (( L ‘𝑦) ∪ ( R ‘𝑦)))
14	13	raleqdv 3326	. . . . 5 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → (∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜒 ↔ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒))
15	11, 14	raleqbidv 3343	. . . 4 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → (∀𝑧 ∈ Pred (𝑅, No , 𝑥)∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜒 ↔ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜒))
16	11	raleqdv 3326	. . . 4 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → (∀𝑧 ∈ Pred (𝑅, No , 𝑥)𝜓 ↔ ∀𝑧 ∈ (( L ‘𝑥) ∪ ( R ‘𝑥))𝜓))
17	13	raleqdv 3326	. . . 4 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → (∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜃 ↔ ∀𝑤 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))𝜃))
18	15, 16, 17	3anbi123d 1437	. . 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 ‘𝑦))𝜃) → 𝜑))
20	18, 19	sylbid 239	. 2 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ) → ((∀𝑧 ∈ Pred (𝑅, No , 𝑥)∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜒 ∧ ∀𝑧 ∈ Pred (𝑅, No , 𝑥)𝜓 ∧ ∀𝑤 ∈ Pred (𝑅, No , 𝑦)𝜃) → 𝜑))
21	2, 3, 4, 2, 3, 4, 5, 6, 7, 8, 9, 20	xpord2ind 8129	1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → 𝜂)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   ∧ w3a 1088   = wceq 1542   ∈ wcel 2107  ∀wral 3062   ∪ cun 3945  {copab 5209  Predcpred 6296  ‘cfv 6540   No csur 27123   L cleft 27320   R cright 27321

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7720

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-tp 4632  df-op 4634  df-uni 4908  df-int 4950  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-se 5631  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7360  df-ov 7407  df-oprab 7408  df-mpo 7409  df-1st 7970  df-2nd 7971  df-frecs 8261  df-wrecs 8292  df-recs 8366  df-1o 8461  df-2o 8462  df-no 27126  df-slt 27127  df-bday 27128  df-sslt 27263  df-scut 27265  df-made 27322  df-old 27323  df-left 27325  df-right 27326

This theorem is referenced by:  no2inds  27419