Theorem noetalem2 27711

Description: Lemma for noeta 27712. 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 3485	. . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
2	1	anim2i 617	. . 3 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) → (𝐴 ⊆ No ∧ 𝐴 ∈ V))
3		elex 3485	. . . 4 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V)
4	3	anim2i 617	. . 3 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) → (𝐵 ⊆ No ∧ 𝐵 ∈ V))
5		id 22	. . 3 ⊢ (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏 → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏)
6	2, 4, 5	3anim123i 1151	. 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 2736	. . . 4 ⊢ (𝑆 ∪ ((suc ∪ ( bday “ 𝐵) ∖ dom 𝑆) × {1o})) = (𝑆 ∪ ((suc ∪ ( bday “ 𝐵) ∖ dom 𝑆) × {1o}))
10		eqid 2736	. . . 4 ⊢ (𝑇 ∪ ((suc ∪ ( bday “ 𝐴) ∖ dom 𝑇) × {2o})) = (𝑇 ∪ ((suc ∪ ( bday “ 𝐴) ∖ dom 𝑇) × {2o}))
11	7, 8, 9, 10	noetalem1 27710	. . 3 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂)) → ((𝑆 ∈ No ∧ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑆 ∧ ∀𝑏 ∈ 𝐵 𝑆 <s 𝑏 ∧ ( bday ‘𝑆) ⊆ 𝑂)) ∨ (𝑇 ∈ No ∧ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑇 ∧ ∀𝑏 ∈ 𝐵 𝑇 <s 𝑏 ∧ ( bday ‘𝑇) ⊆ 𝑂))))
12		breq2 5128	. . . . . . 7 ⊢ (𝑐 = 𝑆 → (𝑎 <s 𝑐 ↔ 𝑎 <s 𝑆))
13	12	ralbidv 3164	. . . . . 6 ⊢ (𝑐 = 𝑆 → (∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ↔ ∀𝑎 ∈ 𝐴 𝑎 <s 𝑆))
14		breq1 5127	. . . . . . 7 ⊢ (𝑐 = 𝑆 → (𝑐 <s 𝑏 ↔ 𝑆 <s 𝑏))
15	14	ralbidv 3164	. . . . . 6 ⊢ (𝑐 = 𝑆 → (∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ↔ ∀𝑏 ∈ 𝐵 𝑆 <s 𝑏))
16		fveq2 6881	. . . . . . 7 ⊢ (𝑐 = 𝑆 → ( bday ‘𝑐) = ( bday ‘𝑆))
17	16	sseq1d 3995	. . . . . 6 ⊢ (𝑐 = 𝑆 → (( bday ‘𝑐) ⊆ 𝑂 ↔ ( bday ‘𝑆) ⊆ 𝑂))
18	13, 15, 17	3anbi123d 1438	. . . . 5 ⊢ (𝑐 = 𝑆 → ((∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ∧ ∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ∧ ( bday ‘𝑐) ⊆ 𝑂) ↔ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑆 ∧ ∀𝑏 ∈ 𝐵 𝑆 <s 𝑏 ∧ ( bday ‘𝑆) ⊆ 𝑂)))
19	18	rspcev 3606	. . . 4 ⊢ ((𝑆 ∈ No ∧ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑆 ∧ ∀𝑏 ∈ 𝐵 𝑆 <s 𝑏 ∧ ( bday ‘𝑆) ⊆ 𝑂)) → ∃𝑐 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ∧ ∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ∧ ( bday ‘𝑐) ⊆ 𝑂))
20		breq2 5128	. . . . . . 7 ⊢ (𝑐 = 𝑇 → (𝑎 <s 𝑐 ↔ 𝑎 <s 𝑇))
21	20	ralbidv 3164	. . . . . 6 ⊢ (𝑐 = 𝑇 → (∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ↔ ∀𝑎 ∈ 𝐴 𝑎 <s 𝑇))
22		breq1 5127	. . . . . . 7 ⊢ (𝑐 = 𝑇 → (𝑐 <s 𝑏 ↔ 𝑇 <s 𝑏))
23	22	ralbidv 3164	. . . . . 6 ⊢ (𝑐 = 𝑇 → (∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ↔ ∀𝑏 ∈ 𝐵 𝑇 <s 𝑏))
24		fveq2 6881	. . . . . . 7 ⊢ (𝑐 = 𝑇 → ( bday ‘𝑐) = ( bday ‘𝑇))
25	24	sseq1d 3995	. . . . . 6 ⊢ (𝑐 = 𝑇 → (( bday ‘𝑐) ⊆ 𝑂 ↔ ( bday ‘𝑇) ⊆ 𝑂))
26	21, 23, 25	3anbi123d 1438	. . . . 5 ⊢ (𝑐 = 𝑇 → ((∀𝑎 ∈ 𝐴 𝑎 <s 𝑐 ∧ ∀𝑏 ∈ 𝐵 𝑐 <s 𝑏 ∧ ( bday ‘𝑐) ⊆ 𝑂) ↔ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑇 ∧ ∀𝑏 ∈ 𝐵 𝑇 <s 𝑏 ∧ ( bday ‘𝑇) ⊆ 𝑂)))
27	26	rspcev 3606	. . . 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 1540   ∈ wcel 2109  {cab 2714  ∀wral 3052  ∃wrex 3061  Vcvv 3464   ∖ cdif 3928   ∪ cun 3929   ⊆ wss 3931  ifcif 4505  {csn 4606  ⟨cop 4612  ∪ cuni 4888   class class class wbr 5124   ↦ cmpt 5206   × cxp 5657  dom cdm 5659   ↾ cres 5661   “ cima 5662  Oncon0 6357  suc csuc 6359  ℩cio 6487  ‘cfv 6536  ℩crio 7366  1_oc1o 8478  2_oc2o 8479   No csur 27608   <s cslt 27609   bday cbday 27610

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 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734

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 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-tp 4611  df-op 4613  df-uni 4889  df-int 4928  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6360  df-on 6361  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-1o 8485  df-2o 8486  df-no 27611  df-slt 27612  df-bday 27613

This theorem is referenced by:  noeta  27712