MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  noetalem2 Structured version   Visualization version   GIF version

Theorem noetalem2 27681
Description: Lemma for noeta 27682. 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
StepHypRef Expression
1 elex 3457 . . . 4 (𝐴𝑉𝐴 ∈ V)
21anim2i 617 . . 3 ((𝐴 No 𝐴𝑉) → (𝐴 No 𝐴 ∈ V))
3 elex 3457 . . . 4 (𝐵𝑊𝐵 ∈ V)
43anim2i 617 . . 3 ((𝐵 No 𝐵𝑊) → (𝐵 No 𝐵 ∈ V))
5 id 22 . . 3 (∀𝑎𝐴𝑏𝐵 𝑎 <s 𝑏 → ∀𝑎𝐴𝑏𝐵 𝑎 <s 𝑏)
62, 4, 53anim123i 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 2731 . . . 4 (𝑆 ∪ ((suc ( bday 𝐵) ∖ dom 𝑆) × {1o})) = (𝑆 ∪ ((suc ( bday 𝐵) ∖ dom 𝑆) × {1o}))
10 eqid 2731 . . . 4 (𝑇 ∪ ((suc ( bday 𝐴) ∖ dom 𝑇) × {2o})) = (𝑇 ∪ ((suc ( bday 𝐴) ∖ dom 𝑇) × {2o}))
117, 8, 9, 10noetalem1 27680 . . 3 ((((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ ∀𝑎𝐴𝑏𝐵 𝑎 <s 𝑏) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂)) → ((𝑆 No ∧ (∀𝑎𝐴 𝑎 <s 𝑆 ∧ ∀𝑏𝐵 𝑆 <s 𝑏 ∧ ( bday 𝑆) ⊆ 𝑂)) ∨ (𝑇 No ∧ (∀𝑎𝐴 𝑎 <s 𝑇 ∧ ∀𝑏𝐵 𝑇 <s 𝑏 ∧ ( bday 𝑇) ⊆ 𝑂))))
12 breq2 5093 . . . . . . 7 (𝑐 = 𝑆 → (𝑎 <s 𝑐𝑎 <s 𝑆))
1312ralbidv 3155 . . . . . 6 (𝑐 = 𝑆 → (∀𝑎𝐴 𝑎 <s 𝑐 ↔ ∀𝑎𝐴 𝑎 <s 𝑆))
14 breq1 5092 . . . . . . 7 (𝑐 = 𝑆 → (𝑐 <s 𝑏𝑆 <s 𝑏))
1514ralbidv 3155 . . . . . 6 (𝑐 = 𝑆 → (∀𝑏𝐵 𝑐 <s 𝑏 ↔ ∀𝑏𝐵 𝑆 <s 𝑏))
16 fveq2 6822 . . . . . . 7 (𝑐 = 𝑆 → ( bday 𝑐) = ( bday 𝑆))
1716sseq1d 3961 . . . . . 6 (𝑐 = 𝑆 → (( bday 𝑐) ⊆ 𝑂 ↔ ( bday 𝑆) ⊆ 𝑂))
1813, 15, 173anbi123d 1438 . . . . 5 (𝑐 = 𝑆 → ((∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂) ↔ (∀𝑎𝐴 𝑎 <s 𝑆 ∧ ∀𝑏𝐵 𝑆 <s 𝑏 ∧ ( bday 𝑆) ⊆ 𝑂)))
1918rspcev 3572 . . . 4 ((𝑆 No ∧ (∀𝑎𝐴 𝑎 <s 𝑆 ∧ ∀𝑏𝐵 𝑆 <s 𝑏 ∧ ( bday 𝑆) ⊆ 𝑂)) → ∃𝑐 No (∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂))
20 breq2 5093 . . . . . . 7 (𝑐 = 𝑇 → (𝑎 <s 𝑐𝑎 <s 𝑇))
2120ralbidv 3155 . . . . . 6 (𝑐 = 𝑇 → (∀𝑎𝐴 𝑎 <s 𝑐 ↔ ∀𝑎𝐴 𝑎 <s 𝑇))
22 breq1 5092 . . . . . . 7 (𝑐 = 𝑇 → (𝑐 <s 𝑏𝑇 <s 𝑏))
2322ralbidv 3155 . . . . . 6 (𝑐 = 𝑇 → (∀𝑏𝐵 𝑐 <s 𝑏 ↔ ∀𝑏𝐵 𝑇 <s 𝑏))
24 fveq2 6822 . . . . . . 7 (𝑐 = 𝑇 → ( bday 𝑐) = ( bday 𝑇))
2524sseq1d 3961 . . . . . 6 (𝑐 = 𝑇 → (( bday 𝑐) ⊆ 𝑂 ↔ ( bday 𝑇) ⊆ 𝑂))
2621, 23, 253anbi123d 1438 . . . . 5 (𝑐 = 𝑇 → ((∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂) ↔ (∀𝑎𝐴 𝑎 <s 𝑇 ∧ ∀𝑏𝐵 𝑇 <s 𝑏 ∧ ( bday 𝑇) ⊆ 𝑂)))
2726rspcev 3572 . . . 4 ((𝑇 No ∧ (∀𝑎𝐴 𝑎 <s 𝑇 ∧ ∀𝑏𝐵 𝑇 <s 𝑏 ∧ ( bday 𝑇) ⊆ 𝑂)) → ∃𝑐 No (∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂))
2819, 27jaoi 857 . . 3 (((𝑆 No ∧ (∀𝑎𝐴 𝑎 <s 𝑆 ∧ ∀𝑏𝐵 𝑆 <s 𝑏 ∧ ( bday 𝑆) ⊆ 𝑂)) ∨ (𝑇 No ∧ (∀𝑎𝐴 𝑎 <s 𝑇 ∧ ∀𝑏𝐵 𝑇 <s 𝑏 ∧ ( bday 𝑇) ⊆ 𝑂))) → ∃𝑐 No (∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂))
2911, 28syl 17 . 2 ((((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ ∀𝑎𝐴𝑏𝐵 𝑎 <s 𝑏) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂)) → ∃𝑐 No (∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂))
306, 29sylan 580 1 ((((𝐴 No 𝐴𝑉) ∧ (𝐵 No 𝐵𝑊) ∧ ∀𝑎𝐴𝑏𝐵 𝑎 <s 𝑏) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂)) → ∃𝑐 No (∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  wo 847  w3a 1086   = wceq 1541  wcel 2111  {cab 2709  wral 3047  wrex 3056  Vcvv 3436  cdif 3894  cun 3895  wss 3897  ifcif 4472  {csn 4573  cop 4579   cuni 4856   class class class wbr 5089  cmpt 5170   × cxp 5612  dom cdm 5614  cres 5616  cima 5617  Oncon0 6306  suc csuc 6308  cio 6435  cfv 6481  crio 7302  1oc1o 8378  2oc2o 8379   No csur 27578   <s cslt 27579   bday cbday 27580
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-tp 4578  df-op 4580  df-uni 4857  df-int 4896  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-ord 6309  df-on 6310  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-riota 7303  df-1o 8385  df-2o 8386  df-no 27581  df-slt 27582  df-bday 27583
This theorem is referenced by:  noeta  27682
  Copyright terms: Public domain W3C validator