Theorem madebdaylemold 27904

Description: Lemma for madebday 27906. If the inductive hypothesis of madebday 27906 is satisfied, the converse of oldbdayim 27895 holds. (Contributed by Scott Fenton, 19-Aug-2024.)

Assertion

Ref	Expression
madebdaylemold	⊢ ((𝐴 ∈ On ∧ ∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No (( bday ‘𝑦) ⊆ 𝑏 → 𝑦 ∈ ( M ‘𝑏)) ∧ 𝑋 ∈ No ) → (( bday ‘𝑋) ∈ 𝐴 → 𝑋 ∈ ( O ‘𝐴)))

Distinct variable groups:   𝐴,𝑏   𝑦,𝑏,𝑋

Allowed substitution hint:   𝐴(𝑦)

Proof of Theorem madebdaylemold

Step	Hyp	Ref	Expression
1		fveq2 6834	. . . . . . . . 9 ⊢ (𝑦 = 𝑋 → ( bday ‘𝑦) = ( bday ‘𝑋))
2	1	sseq1d 3954	. . . . . . . 8 ⊢ (𝑦 = 𝑋 → (( bday ‘𝑦) ⊆ 𝑏 ↔ ( bday ‘𝑋) ⊆ 𝑏))
3		eleq1 2825	. . . . . . . 8 ⊢ (𝑦 = 𝑋 → (𝑦 ∈ ( M ‘𝑏) ↔ 𝑋 ∈ ( M ‘𝑏)))
4	2, 3	imbi12d 344	. . . . . . 7 ⊢ (𝑦 = 𝑋 → ((( bday ‘𝑦) ⊆ 𝑏 → 𝑦 ∈ ( M ‘𝑏)) ↔ (( bday ‘𝑋) ⊆ 𝑏 → 𝑋 ∈ ( M ‘𝑏))))
5	4	rspcv 3561	. . . . . 6 ⊢ (𝑋 ∈ No → (∀𝑦 ∈ No (( bday ‘𝑦) ⊆ 𝑏 → 𝑦 ∈ ( M ‘𝑏)) → (( bday ‘𝑋) ⊆ 𝑏 → 𝑋 ∈ ( M ‘𝑏))))
6	5	ralimdv 3152	. . . . 5 ⊢ (𝑋 ∈ No → (∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No (( bday ‘𝑦) ⊆ 𝑏 → 𝑦 ∈ ( M ‘𝑏)) → ∀𝑏 ∈ 𝐴 (( bday ‘𝑋) ⊆ 𝑏 → 𝑋 ∈ ( M ‘𝑏))))
7	6	impcom 407	. . . 4 ⊢ ((∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No (( bday ‘𝑦) ⊆ 𝑏 → 𝑦 ∈ ( M ‘𝑏)) ∧ 𝑋 ∈ No ) → ∀𝑏 ∈ 𝐴 (( bday ‘𝑋) ⊆ 𝑏 → 𝑋 ∈ ( M ‘𝑏)))
8		rexim 3079	. . . 4 ⊢ (∀𝑏 ∈ 𝐴 (( bday ‘𝑋) ⊆ 𝑏 → 𝑋 ∈ ( M ‘𝑏)) → (∃𝑏 ∈ 𝐴 ( bday ‘𝑋) ⊆ 𝑏 → ∃𝑏 ∈ 𝐴 𝑋 ∈ ( M ‘𝑏)))
9	7, 8	syl 17	. . 3 ⊢ ((∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No (( bday ‘𝑦) ⊆ 𝑏 → 𝑦 ∈ ( M ‘𝑏)) ∧ 𝑋 ∈ No ) → (∃𝑏 ∈ 𝐴 ( bday ‘𝑋) ⊆ 𝑏 → ∃𝑏 ∈ 𝐴 𝑋 ∈ ( M ‘𝑏)))
10	9	3adant1 1131	. 2 ⊢ ((𝐴 ∈ On ∧ ∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No (( bday ‘𝑦) ⊆ 𝑏 → 𝑦 ∈ ( M ‘𝑏)) ∧ 𝑋 ∈ No ) → (∃𝑏 ∈ 𝐴 ( bday ‘𝑋) ⊆ 𝑏 → ∃𝑏 ∈ 𝐴 𝑋 ∈ ( M ‘𝑏)))
11		bdayon 27758	. . . 4 ⊢ ( bday ‘𝑋) ∈ On
12		onelssex 6366	. . . 4 ⊢ ((( bday ‘𝑋) ∈ On ∧ 𝐴 ∈ On) → (( bday ‘𝑋) ∈ 𝐴 ↔ ∃𝑏 ∈ 𝐴 ( bday ‘𝑋) ⊆ 𝑏))
13	11, 12	mpan 691	. . 3 ⊢ (𝐴 ∈ On → (( bday ‘𝑋) ∈ 𝐴 ↔ ∃𝑏 ∈ 𝐴 ( bday ‘𝑋) ⊆ 𝑏))
14	13	3ad2ant1 1134	. 2 ⊢ ((𝐴 ∈ On ∧ ∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No (( bday ‘𝑦) ⊆ 𝑏 → 𝑦 ∈ ( M ‘𝑏)) ∧ 𝑋 ∈ No ) → (( bday ‘𝑋) ∈ 𝐴 ↔ ∃𝑏 ∈ 𝐴 ( bday ‘𝑋) ⊆ 𝑏))
15		elold 27865	. . 3 ⊢ (𝐴 ∈ On → (𝑋 ∈ ( O ‘𝐴) ↔ ∃𝑏 ∈ 𝐴 𝑋 ∈ ( M ‘𝑏)))
16	15	3ad2ant1 1134	. 2 ⊢ ((𝐴 ∈ On ∧ ∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No (( bday ‘𝑦) ⊆ 𝑏 → 𝑦 ∈ ( M ‘𝑏)) ∧ 𝑋 ∈ No ) → (𝑋 ∈ ( O ‘𝐴) ↔ ∃𝑏 ∈ 𝐴 𝑋 ∈ ( M ‘𝑏)))
17	10, 14, 16	3imtr4d 294	1 ⊢ ((𝐴 ∈ On ∧ ∀𝑏 ∈ 𝐴 ∀𝑦 ∈ No (( bday ‘𝑦) ⊆ 𝑏 → 𝑦 ∈ ( M ‘𝑏)) ∧ 𝑋 ∈ No ) → (( bday ‘𝑋) ∈ 𝐴 → 𝑋 ∈ ( O ‘𝐴)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062   ⊆ wss 3890  Oncon0 6317  ‘cfv 6492   No csur 27617   bday cbday 27619   M cmade 27828   O cold 27829

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-1o 8398  df-2o 8399  df-no 27620  df-lts 27621  df-bday 27622  df-slts 27764  df-cuts 27766  df-made 27833  df-old 27834

This theorem is referenced by:  madebdaylemlrcut  27905  oldbday  27907