Theorem noetalem5 33334

Description: Lemma for noeta 33335. The full statement of the theorem with hypotheses. (Contributed by Scott Fenton, 7-Dec-2021.)

Hypotheses

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

Assertion

Ref	Expression
noetalem5	⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → ∃𝑧 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑧 ∧ ∀𝑏 ∈ 𝐵 𝑧 <s 𝑏 ∧ ( bday ‘𝑧) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))))

Distinct variable groups:   𝐴,𝑎,𝑏,𝑔   𝑢,𝑎,𝐴,𝑣,𝑥,𝑦   𝑧,𝑎,𝐴   𝐵,𝑎,𝑏   𝑔,𝑏,𝑥   𝑧,𝑏,𝐵   𝑢,𝑔,𝑣,𝑥,𝑦   𝑆,𝑎,𝑔   𝑣,𝑢,𝑥,𝑦   𝑍,𝑎,𝑏,𝑧

Allowed substitution hints:   𝐵(𝑥,𝑦,𝑣,𝑢,𝑔)   𝑆(𝑥,𝑦,𝑧,𝑣,𝑢,𝑏)   𝑉(𝑥,𝑦,𝑧,𝑣,𝑢,𝑔,𝑎,𝑏)   𝑊(𝑥,𝑦,𝑧,𝑣,𝑢,𝑔,𝑎,𝑏)   𝑍(𝑥,𝑦,𝑣,𝑢,𝑔)

Proof of Theorem noetalem5

Step	Hyp	Ref	Expression
1		elex 3459	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
2	1	anim2i 619	. 2 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) → (𝐴 ⊆ No ∧ 𝐴 ∈ V))
3		elex 3459	. . 3 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V)
4	3	anim2i 619	. 2 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) → (𝐵 ⊆ No ∧ 𝐵 ∈ V))
5		id 22	. 2 ⊢ (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏 → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏)
6		simp1l 1194	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → 𝐴 ⊆ No )
7		simp1r 1195	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → 𝐴 ∈ V)
8		simp2r 1197	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → 𝐵 ∈ V)
9		noetalem.1	. . . . 5 ⊢ 𝑆 = if(∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦, ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2o⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
10		noetalem.2	. . . . 5 ⊢ 𝑍 = (𝑆 ∪ ((suc ∪ ( bday “ 𝐵) ∖ dom 𝑆) × {1o}))
11	9, 10	noetalem1 33330	. . . 4 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ∈ V ∧ 𝐵 ∈ V) → 𝑍 ∈ No )
12	6, 7, 8, 11	syl3anc 1368	. . 3 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → 𝑍 ∈ No )
13		simplll 774	. . . . . 6 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) ∧ 𝑎 ∈ 𝐴) → 𝐴 ⊆ No )
14		simpllr 775	. . . . . 6 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) ∧ 𝑎 ∈ 𝐴) → 𝐴 ∈ V)
15		simplrr 777	. . . . . 6 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) ∧ 𝑎 ∈ 𝐴) → 𝐵 ∈ V)
16		simpr 488	. . . . . 6 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
17	9, 10	noetalem2 33331	. . . . . 6 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑎 ∈ 𝐴) → 𝑎 <s 𝑍)
18	13, 14, 15, 16, 17	syl31anc 1370	. . . . 5 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) ∧ 𝑎 ∈ 𝐴) → 𝑎 <s 𝑍)
19	18	ralrimiva 3149	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) → ∀𝑎 ∈ 𝐴 𝑎 <s 𝑍)
20	19	3adant3 1129	. . 3 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → ∀𝑎 ∈ 𝐴 𝑎 <s 𝑍)
21	9, 10	noetalem3 33332	. . 3 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → ∀𝑏 ∈ 𝐵 𝑍 <s 𝑏)
22	9, 10	noetalem4 33333	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) → ( bday ‘𝑍) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵)))
23	22	3adant3 1129	. . 3 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → ( bday ‘𝑍) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵)))
24		breq2 5034	. . . . . 6 ⊢ (𝑧 = 𝑍 → (𝑎 <s 𝑧 ↔ 𝑎 <s 𝑍))
25	24	ralbidv 3162	. . . . 5 ⊢ (𝑧 = 𝑍 → (∀𝑎 ∈ 𝐴 𝑎 <s 𝑧 ↔ ∀𝑎 ∈ 𝐴 𝑎 <s 𝑍))
26		breq1 5033	. . . . . 6 ⊢ (𝑧 = 𝑍 → (𝑧 <s 𝑏 ↔ 𝑍 <s 𝑏))
27	26	ralbidv 3162	. . . . 5 ⊢ (𝑧 = 𝑍 → (∀𝑏 ∈ 𝐵 𝑧 <s 𝑏 ↔ ∀𝑏 ∈ 𝐵 𝑍 <s 𝑏))
28		fveq2 6645	. . . . . 6 ⊢ (𝑧 = 𝑍 → ( bday ‘𝑧) = ( bday ‘𝑍))
29	28	sseq1d 3946	. . . . 5 ⊢ (𝑧 = 𝑍 → (( bday ‘𝑧) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵)) ↔ ( bday ‘𝑍) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))))
30	25, 27, 29	3anbi123d 1433	. . . 4 ⊢ (𝑧 = 𝑍 → ((∀𝑎 ∈ 𝐴 𝑎 <s 𝑧 ∧ ∀𝑏 ∈ 𝐵 𝑧 <s 𝑏 ∧ ( bday ‘𝑧) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))) ↔ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑍 ∧ ∀𝑏 ∈ 𝐵 𝑍 <s 𝑏 ∧ ( bday ‘𝑍) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵)))))
31	30	rspcev 3571	. . 3 ⊢ ((𝑍 ∈ No ∧ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑍 ∧ ∀𝑏 ∈ 𝐵 𝑍 <s 𝑏 ∧ ( bday ‘𝑍) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵)))) → ∃𝑧 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑧 ∧ ∀𝑏 ∈ 𝐵 𝑧 <s 𝑏 ∧ ( bday ‘𝑧) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))))
32	12, 20, 21, 23, 31	syl13anc 1369	. 2 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → ∃𝑧 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑧 ∧ ∀𝑏 ∈ 𝐵 𝑧 <s 𝑏 ∧ ( bday ‘𝑧) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))))
33	2, 4, 5, 32	syl3an 1157	1 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → ∃𝑧 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑧 ∧ ∀𝑏 ∈ 𝐵 𝑧 <s 𝑏 ∧ ( bday ‘𝑧) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  {cab 2776  ∀wral 3106  ∃wrex 3107  Vcvv 3441   ∖ cdif 3878   ∪ cun 3879   ⊆ wss 3881  ifcif 4425  {csn 4525  ⟨cop 4531  ∪ cuni 4800   class class class wbr 5030   ↦ cmpt 5110   × cxp 5517  dom cdm 5519   ↾ cres 5521   “ cima 5522  suc csuc 6161  ℩cio 6281  ‘cfv 6324  ℩crio 7092  1_oc1o 8078  2_oc2o 8079   No csur 33260   <s cslt 33261   bday cbday 33262

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-ord 6162  df-on 6163  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-1o 8085  df-2o 8086  df-no 33263  df-slt 33264  df-bday 33265

This theorem is referenced by:  noeta  33335