Theorem no2inds 28341

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.

Step	Hyp	Ref	Expression
1		eqid 2761	. 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‘𝑦))𝜃) → 𝜑))
8	1, 2, 3, 4, 5, 6, 7	no2indlesm 28340	1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No) → 𝜂)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077   ∪ cun 3897  {copab 5167  ‘cfv 6538  Nocsur 27997  Lcleft 28211  Rcright 28212

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-1o 8476  df-2o 8477  df-no 28000  df-lts 28001  df-bday 28002  df-slts 28144  df-cuts 28146  df-made 28213  df-old 28214  df-left 28216  df-right 28217

This theorem is used by:  addscom  28352  addbday  28404  mulscom  28525