Theorem noetalem2 27802

Description: Lemma for noeta 27803. The full statement of the theorem with hypotheses in place. (Contributed by Scott Fenton, 10-Aug-2024.)

Hypotheses

Ref	Expression
noetalem2.1	⊢ 𝑆 = if(∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦, ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
noetalem2.2	⊢ 𝑇 = if(∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥, ((℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))

Assertion

Ref	Expression
noetalem2	⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂)) → ∃𝑐 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ∧ ∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ∧ ( bday ‘𝑐) ⊆ 𝑂))

Distinct variable groups:   𝐴,𝑎,𝑏,𝑐   𝑔,𝑎,𝐴,𝑢,𝑣,𝑥,𝑦   𝐵,𝑎,𝑏,𝑐   𝑔,𝑏,𝐵   𝑢,𝐵   𝑣,𝑏,𝐵,𝑥,𝑦   𝑢,𝑔,𝑣,𝑥,𝑦   𝑂,𝑐   𝑢,𝑂,𝑦   𝑆,𝑎,𝑏,𝑐   𝑆,𝑔,𝑥   𝑇,𝑎,𝑏,𝑐   𝑇,𝑔,𝑥   𝑣,𝑢,𝑥,𝑦

Allowed substitution hints:   𝑆(𝑦,𝑣,𝑢)   𝑇(𝑦,𝑣,𝑢)   𝑂(𝑥,𝑣,𝑔,𝑎,𝑏)   𝑉(𝑥,𝑦,𝑣,𝑢,𝑔,𝑎,𝑏,𝑐)   𝑊(𝑥,𝑦,𝑣,𝑢,𝑔,𝑎,𝑏,𝑐)

Proof of Theorem noetalem2

Step	Hyp	Ref	Expression
1		elex 3499	. . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
2	1	anim2i 617	. . 3 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) → (𝐴 ⊆ No ∧ 𝐴 ∈ V))
3		elex 3499	. . . 4 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V)
4	3	anim2i 617	. . 3 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) → (𝐵 ⊆ No ∧ 𝐵 ∈ V))
5		id 22	. . 3 ⊢ (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏 → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏)
6	2, 4, 5	3anim123i 1150	. 2 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → ((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏))
7		noetalem2.1	. . . 4 ⊢ 𝑆 = if(∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦, ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
8		noetalem2.2	. . . 4 ⊢ 𝑇 = if(∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥, ((℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥) ∪ {⟨dom (℩𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦 <s 𝑥), 1o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐵 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐵 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐵 (¬ 𝑢 <s 𝑣 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
9		eqid 2735	. . . 4 ⊢ (𝑆 ∪ ((suc ∪ ( bday “ 𝐵) ∖ dom 𝑆) × {1o})) = (𝑆 ∪ ((suc ∪ ( bday “ 𝐵) ∖ dom 𝑆) × {1o}))
10		eqid 2735	. . . 4 ⊢ (𝑇 ∪ ((suc ∪ ( bday “ 𝐴) ∖ dom 𝑇) × {2o})) = (𝑇 ∪ ((suc ∪ ( bday “ 𝐴) ∖ dom 𝑇) × {2o}))
11	7, 8, 9, 10	noetalem1 27801	. . 3 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂)) → ((𝑆 ∈ No ∧ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑆 ∧ ∀𝑏 ∈ 𝐵 𝑆 <s 𝑏 ∧ ( bday ‘𝑆) ⊆ 𝑂)) ∨ (𝑇 ∈ No ∧ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑇 ∧ ∀𝑏 ∈ 𝐵 𝑇 <s 𝑏 ∧ ( bday ‘𝑇) ⊆ 𝑂))))
12		breq2 5152	. . . . . . 7 ⊢ (𝑐 = 𝑆 → (𝑎 <s 𝑐 ↔ 𝑎 <s 𝑆))
13	12	ralbidv 3176	. . . . . 6 ⊢ (𝑐 = 𝑆 → (∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ↔ ∀𝑎 ∈ 𝐴 𝑎 <s 𝑆))
14		breq1 5151	. . . . . . 7 ⊢ (𝑐 = 𝑆 → (𝑐 <s 𝑏 ↔ 𝑆 <s 𝑏))
15	14	ralbidv 3176	. . . . . 6 ⊢ (𝑐 = 𝑆 → (∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ↔ ∀𝑏 ∈ 𝐵 𝑆 <s 𝑏))
16		fveq2 6907	. . . . . . 7 ⊢ (𝑐 = 𝑆 → ( bday ‘𝑐) = ( bday ‘𝑆))
17	16	sseq1d 4027	. . . . . 6 ⊢ (𝑐 = 𝑆 → (( bday ‘𝑐) ⊆ 𝑂 ↔ ( bday ‘𝑆) ⊆ 𝑂))
18	13, 15, 17	3anbi123d 1435	. . . . 5 ⊢ (𝑐 = 𝑆 → ((∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ∧ ∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ∧ ( bday ‘𝑐) ⊆ 𝑂) ↔ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑆 ∧ ∀𝑏 ∈ 𝐵 𝑆 <s 𝑏 ∧ ( bday ‘𝑆) ⊆ 𝑂)))
19	18	rspcev 3622	. . . 4 ⊢ ((𝑆 ∈ No ∧ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑆 ∧ ∀𝑏 ∈ 𝐵 𝑆 <s 𝑏 ∧ ( bday ‘𝑆) ⊆ 𝑂)) → ∃𝑐 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ∧ ∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ∧ ( bday ‘𝑐) ⊆ 𝑂))
20		breq2 5152	. . . . . . 7 ⊢ (𝑐 = 𝑇 → (𝑎 <s 𝑐 ↔ 𝑎 <s 𝑇))
21	20	ralbidv 3176	. . . . . 6 ⊢ (𝑐 = 𝑇 → (∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ↔ ∀𝑎 ∈ 𝐴 𝑎 <s 𝑇))
22		breq1 5151	. . . . . . 7 ⊢ (𝑐 = 𝑇 → (𝑐 <s 𝑏 ↔ 𝑇 <s 𝑏))
23	22	ralbidv 3176	. . . . . 6 ⊢ (𝑐 = 𝑇 → (∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ↔ ∀𝑏 ∈ 𝐵 𝑇 <s 𝑏))
24		fveq2 6907	. . . . . . 7 ⊢ (𝑐 = 𝑇 → ( bday ‘𝑐) = ( bday ‘𝑇))
25	24	sseq1d 4027	. . . . . 6 ⊢ (𝑐 = 𝑇 → (( bday ‘𝑐) ⊆ 𝑂 ↔ ( bday ‘𝑇) ⊆ 𝑂))
26	21, 23, 25	3anbi123d 1435	. . . . 5 ⊢ (𝑐 = 𝑇 → ((∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ∧ ∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ∧ ( bday ‘𝑐) ⊆ 𝑂) ↔ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑇 ∧ ∀𝑏 ∈ 𝐵 𝑇 <s 𝑏 ∧ ( bday ‘𝑇) ⊆ 𝑂)))
27	26	rspcev 3622	. . . 4 ⊢ ((𝑇 ∈ No ∧ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑇 ∧ ∀𝑏 ∈ 𝐵 𝑇 <s 𝑏 ∧ ( bday ‘𝑇) ⊆ 𝑂)) → ∃𝑐 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ∧ ∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ∧ ( bday ‘𝑐) ⊆ 𝑂))
28	19, 27	jaoi 857	. . 3 ⊢ (((𝑆 ∈ No ∧ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑆 ∧ ∀𝑏 ∈ 𝐵 𝑆 <s 𝑏 ∧ ( bday ‘𝑆) ⊆ 𝑂)) ∨ (𝑇 ∈ No ∧ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑇 ∧ ∀𝑏 ∈ 𝐵 𝑇 <s 𝑏 ∧ ( bday ‘𝑇) ⊆ 𝑂))) → ∃𝑐 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ∧ ∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ∧ ( bday ‘𝑐) ⊆ 𝑂))
29	11, 28	syl 17	. 2 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂)) → ∃𝑐 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ∧ ∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ∧ ( bday ‘𝑐) ⊆ 𝑂))
30	6, 29	sylan 580	1 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂)) → ∃𝑐 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ∧ ∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ∧ ( bday ‘𝑐) ⊆ 𝑂))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1537   ∈ wcel 2106  {cab 2712  ∀wral 3059  ∃wrex 3068  Vcvv 3478   ∖ cdif 3960   ∪ cun 3961   ⊆ wss 3963  ifcif 4531  {csn 4631  ⟨cop 4637  ∪ cuni 4912   class class class wbr 5148   ↦ cmpt 5231   × cxp 5687  dom cdm 5689   ↾ cres 5691   “ cima 5692  Oncon0 6386  suc csuc 6388  ℩cio 6514  ‘cfv 6563  ℩crio 7387  1_oc1o 8498  2_oc2o 8499   No csur 27699   <s cslt 27700   bday cbday 27701

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-tp 4636  df-op 4638  df-uni 4913  df-int 4952  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-ord 6389  df-on 6390  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-1o 8505  df-2o 8506  df-no 27702  df-slt 27703  df-bday 27704

This theorem is referenced by:  noeta  27803