Theorem addscutlem 28033

Description: Lemma for addscut 28034. Show the statement with some additional distinct variable conditions. (Contributed by Scott Fenton, 8-Mar-2025.)

Hypotheses

Ref	Expression
addscutlem.1	⊢ (𝜑 → 𝑋 ∈ No )
addscutlem.2	⊢ (𝜑 → 𝑌 ∈ No )

Assertion

Ref	Expression
addscutlem	⊢ (𝜑 → ((𝑋 +s 𝑌) ∈ No ∧ ({𝑝 ∣ ∃𝑙 ∈ ( L ‘𝑋)𝑝 = (𝑙 +s 𝑌)} ∪ {𝑞 ∣ ∃𝑚 ∈ ( L ‘𝑌)𝑞 = (𝑋 +s 𝑚)}) <<s {(𝑋 +s 𝑌)} ∧ {(𝑋 +s 𝑌)} <<s ({𝑤 ∣ ∃𝑟 ∈ ( R ‘𝑋)𝑤 = (𝑟 +s 𝑌)} ∪ {𝑡 ∣ ∃𝑠 ∈ ( R ‘𝑌)𝑡 = (𝑋 +s 𝑠)})))

Distinct variable groups:   𝑋,𝑙,𝑚   𝑋,𝑝,𝑞,𝑟,𝑠   𝑡,𝑋,𝑠   𝑤,𝑋   𝑌,𝑙,𝑚   𝑌,𝑝,𝑞,𝑟,𝑠   𝑡,𝑌   𝑤,𝑌   𝑝,𝑙,𝜑,𝑞,𝑟,𝑠   𝜑,𝑚,𝑞,𝑟,𝑠   𝜑,𝑝,𝑞,𝑟,𝑠   𝑤,𝑝   𝜑,𝑡   𝜑,𝑤   𝑡,𝑞,𝑟   𝑤,𝑟

Proof of Theorem addscutlem

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		addsprop 28032	. . . . 5 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ∧ 𝑧 ∈ No ) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥))))
2	1	a1d 25	. . . 4 ⊢ ((𝑥 ∈ No ∧ 𝑦 ∈ No ∧ 𝑧 ∈ No ) → (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘ 0s ))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))))
3	2	rgen3 3203	. . 3 ⊢ ∀𝑥 ∈ No ∀𝑦 ∈ No ∀𝑧 ∈ No (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘ 0s ))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥))))
4	3	a1i 11	. 2 ⊢ (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No ∀𝑧 ∈ No (((( bday ‘𝑥) +no ( bday ‘𝑦)) ∪ (( bday ‘𝑥) +no ( bday ‘𝑧))) ∈ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ (( bday ‘𝑋) +no ( bday ‘ 0s ))) → ((𝑥 +s 𝑦) ∈ No ∧ (𝑦 <s 𝑧 → (𝑦 +s 𝑥) <s (𝑧 +s 𝑥)))))
5		addscutlem.1	. 2 ⊢ (𝜑 → 𝑋 ∈ No )
6		addscutlem.2	. 2 ⊢ (𝜑 → 𝑌 ∈ No )
7	4, 5, 6	addsproplem3 28027	1 ⊢ (𝜑 → ((𝑋 +s 𝑌) ∈ No ∧ ({𝑝 ∣ ∃𝑙 ∈ ( L ‘𝑋)𝑝 = (𝑙 +s 𝑌)} ∪ {𝑞 ∣ ∃𝑚 ∈ ( L ‘𝑌)𝑞 = (𝑋 +s 𝑚)}) <<s {(𝑋 +s 𝑌)} ∧ {(𝑋 +s 𝑌)} <<s ({𝑤 ∣ ∃𝑟 ∈ ( R ‘𝑋)𝑤 = (𝑟 +s 𝑌)} ∪ {𝑡 ∣ ∃𝑠 ∈ ( R ‘𝑌)𝑡 = (𝑋 +s 𝑠)})))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1538   ∈ wcel 2107  {cab 2713  ∀wral 3060  ∃wrex 3069   ∪ cun 3962  {csn 4632   class class class wbr 5149  ‘cfv 6566  (class class class)co 7435   +no cnadd 8708   No csur 27707   <s cslt 27708   bday cbday 27709   <<s csslt 27848   0_s c0s 27890   L cleft 27907   R cright 27908   +_s cadds 28015

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5286  ax-sep 5303  ax-nul 5313  ax-pow 5372  ax-pr 5439  ax-un 7758

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1541  df-fal 1551  df-ex 1778  df-nf 1782  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-rmo 3379  df-reu 3380  df-rab 3435  df-v 3481  df-sbc 3793  df-csb 3910  df-dif 3967  df-un 3969  df-in 3971  df-ss 3981  df-pss 3984  df-nul 4341  df-if 4533  df-pw 4608  df-sn 4633  df-pr 4635  df-tp 4637  df-op 4639  df-uni 4914  df-int 4953  df-iun 4999  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5584  df-eprel 5590  df-po 5598  df-so 5599  df-fr 5642  df-se 5643  df-we 5644  df-xp 5696  df-rel 5697  df-cnv 5698  df-co 5699  df-dm 5700  df-rn 5701  df-res 5702  df-ima 5703  df-pred 6326  df-ord 6392  df-on 6393  df-suc 6395  df-iota 6519  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7392  df-ov 7438  df-oprab 7439  df-mpo 7440  df-1st 8019  df-2nd 8020  df-frecs 8311  df-wrecs 8342  df-recs 8416  df-1o 8511  df-2o 8512  df-nadd 8709  df-no 27710  df-slt 27711  df-bday 27712  df-sslt 27849  df-scut 27851  df-0s 27892  df-made 27909  df-old 27910  df-left 27912  df-right 27913  df-norec2 28005  df-adds 28016

This theorem is referenced by:  addscut  28034