Theorem noetalem5 31867

Description: Lemma for noeta 31868. 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 𝑦), 2𝑜⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
noetalem.2	⊢ 𝑍 = (𝑆 ∪ ((suc ∪ ( bday “ 𝐵) ∖ dom 𝑆) × {1𝑜}))

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 3212	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
2	1	anim2i 593	. 2 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) → (𝐴 ⊆ No ∧ 𝐴 ∈ V))
3		elex 3212	. . 3 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V)
4	3	anim2i 593	. 2 ⊢ ((𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) → (𝐵 ⊆ No ∧ 𝐵 ∈ V))
5		id 22	. 2 ⊢ (∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏 → ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏)
6		simp1l 1085	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → 𝐴 ⊆ No )
7		simp1r 1086	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → 𝐴 ∈ V)
8		simp2r 1088	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → 𝐵 ∈ V)
9		noetalem.1	. . . . 5 ⊢ 𝑆 = if(∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦, ((℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦) ∪ {⟨dom (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 <s 𝑦), 2𝑜⟩}), (𝑔 ∈ {𝑦 ∣ ∃𝑢 ∈ 𝐴 (𝑦 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑦) = (𝑣 ↾ suc 𝑦)))} ↦ (℩𝑥∃𝑢 ∈ 𝐴 (𝑔 ∈ dom 𝑢 ∧ ∀𝑣 ∈ 𝐴 (¬ 𝑣 <s 𝑢 → (𝑢 ↾ suc 𝑔) = (𝑣 ↾ suc 𝑔)) ∧ (𝑢‘𝑔) = 𝑥))))
10		noetalem.2	. . . . 5 ⊢ 𝑍 = (𝑆 ∪ ((suc ∪ ( bday “ 𝐵) ∖ dom 𝑆) × {1𝑜}))
11	9, 10	noetalem1 31863	. . . 4 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ∈ V ∧ 𝐵 ∈ V) → 𝑍 ∈ No )
12	6, 7, 8, 11	syl3anc 1326	. . 3 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → 𝑍 ∈ No )
13		simplll 798	. . . . . 6 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) ∧ 𝑎 ∈ 𝐴) → 𝐴 ⊆ No )
14		simpllr 799	. . . . . 6 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) ∧ 𝑎 ∈ 𝐴) → 𝐴 ∈ V)
15		simplrr 801	. . . . . 6 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) ∧ 𝑎 ∈ 𝐴) → 𝐵 ∈ V)
16		simpr 477	. . . . . 6 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
17	9, 10	noetalem2 31864	. . . . . 6 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑎 ∈ 𝐴) → 𝑎 <s 𝑍)
18	13, 14, 15, 16, 17	syl31anc 1329	. . . . 5 ⊢ ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) ∧ 𝑎 ∈ 𝐴) → 𝑎 <s 𝑍)
19	18	ralrimiva 2966	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) → ∀𝑎 ∈ 𝐴 𝑎 <s 𝑍)
20	19	3adant3 1081	. . 3 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → ∀𝑎 ∈ 𝐴 𝑎 <s 𝑍)
21	9, 10	noetalem3 31865	. . 3 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → ∀𝑏 ∈ 𝐵 𝑍 <s 𝑏)
22	9, 10	noetalem4 31866	. . . 4 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V)) → ( bday ‘𝑍) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵)))
23	22	3adant3 1081	. . 3 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → ( bday ‘𝑍) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵)))
24		breq2 4657	. . . . . 6 ⊢ (𝑧 = 𝑍 → (𝑎 <s 𝑧 ↔ 𝑎 <s 𝑍))
25	24	ralbidv 2986	. . . . 5 ⊢ (𝑧 = 𝑍 → (∀𝑎 ∈ 𝐴 𝑎 <s 𝑧 ↔ ∀𝑎 ∈ 𝐴 𝑎 <s 𝑍))
26		breq1 4656	. . . . . 6 ⊢ (𝑧 = 𝑍 → (𝑧 <s 𝑏 ↔ 𝑍 <s 𝑏))
27	26	ralbidv 2986	. . . . 5 ⊢ (𝑧 = 𝑍 → (∀𝑏 ∈ 𝐵 𝑧 <s 𝑏 ↔ ∀𝑏 ∈ 𝐵 𝑍 <s 𝑏))
28		fveq2 6191	. . . . . 6 ⊢ (𝑧 = 𝑍 → ( bday ‘𝑧) = ( bday ‘𝑍))
29	28	sseq1d 3632	. . . . 5 ⊢ (𝑧 = 𝑍 → (( bday ‘𝑧) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵)) ↔ ( bday ‘𝑍) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))))
30	25, 27, 29	3anbi123d 1399	. . . 4 ⊢ (𝑧 = 𝑍 → ((∀𝑎 ∈ 𝐴 𝑎 <s 𝑧 ∧ ∀𝑏 ∈ 𝐵 𝑧 <s 𝑏 ∧ ( bday ‘𝑧) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))) ↔ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑍 ∧ ∀𝑏 ∈ 𝐵 𝑍 <s 𝑏 ∧ ( bday ‘𝑍) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵)))))
31	30	rspcev 3309	. . 3 ⊢ ((𝑍 ∈ No ∧ (∀𝑎 ∈ 𝐴 𝑎 <s 𝑍 ∧ ∀𝑏 ∈ 𝐵 𝑍 <s 𝑏 ∧ ( bday ‘𝑍) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵)))) → ∃𝑧 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑧 ∧ ∀𝑏 ∈ 𝐵 𝑧 <s 𝑏 ∧ ( bday ‘𝑧) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))))
32	12, 20, 21, 23, 31	syl13anc 1328	. 2 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → ∃𝑧 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑧 ∧ ∀𝑏 ∈ 𝐵 𝑧 <s 𝑏 ∧ ( bday ‘𝑧) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))))
33	2, 4, 5, 32	syl3an 1368	1 ⊢ (((𝐴 ⊆ No ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ 𝑊) ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐵 𝑎 <s 𝑏) → ∃𝑧 ∈ No (∀𝑎 ∈ 𝐴 𝑎 <s 𝑧 ∧ ∀𝑏 ∈ 𝐵 𝑧 <s 𝑏 ∧ ( bday ‘𝑧) ⊆ suc ∪ ( bday “ (𝐴 ∪ 𝐵))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 384   ∧ w3a 1037   = wceq 1483   ∈ wcel 1990  {cab 2608  ∀wral 2912  ∃wrex 2913  Vcvv 3200   ∖ cdif 3571   ∪ cun 3572   ⊆ wss 3574  ifcif 4086  {csn 4177  ⟨cop 4183  ∪ cuni 4436   class class class wbr 4653   ↦ cmpt 4729   × cxp 5112  dom cdm 5114   ↾ cres 5116   “ cima 5117  suc csuc 5725  ℩cio 5849  ‘cfv 5888  ℩crio 6610  1_𝑜c1o 7553  2_𝑜c2o 7554   No csur 31793   <s cslt 31794   bday cbday 31795

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-ord 5726  df-on 5727  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-1o 7560  df-2o 7561  df-no 31796  df-slt 31797  df-bday 31798

This theorem is referenced by:  noeta  31868