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

Theorem noetalem2 27805
Description: Lemma for noeta 27806. 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 3509 . . . 4 (𝐴𝑉𝐴 ∈ V)
21anim2i 616 . . 3 ((𝐴 No 𝐴𝑉) → (𝐴 No 𝐴 ∈ V))
3 elex 3509 . . . 4 (𝐵𝑊𝐵 ∈ V)
43anim2i 616 . . 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 2740 . . . 4 (𝑆 ∪ ((suc ( bday 𝐵) ∖ dom 𝑆) × {1o})) = (𝑆 ∪ ((suc ( bday 𝐵) ∖ dom 𝑆) × {1o}))
10 eqid 2740 . . . 4 (𝑇 ∪ ((suc ( bday 𝐴) ∖ dom 𝑇) × {2o})) = (𝑇 ∪ ((suc ( bday 𝐴) ∖ dom 𝑇) × {2o}))
117, 8, 9, 10noetalem1 27804 . . 3 ((((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ ∀𝑎𝐴𝑏𝐵 𝑎 <s 𝑏) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂)) → ((𝑆 No ∧ (∀𝑎𝐴 𝑎 <s 𝑆 ∧ ∀𝑏𝐵 𝑆 <s 𝑏 ∧ ( bday 𝑆) ⊆ 𝑂)) ∨ (𝑇 No ∧ (∀𝑎𝐴 𝑎 <s 𝑇 ∧ ∀𝑏𝐵 𝑇 <s 𝑏 ∧ ( bday 𝑇) ⊆ 𝑂))))
12 breq2 5170 . . . . . . 7 (𝑐 = 𝑆 → (𝑎 <s 𝑐𝑎 <s 𝑆))
1312ralbidv 3184 . . . . . 6 (𝑐 = 𝑆 → (∀𝑎𝐴 𝑎 <s 𝑐 ↔ ∀𝑎𝐴 𝑎 <s 𝑆))
14 breq1 5169 . . . . . . 7 (𝑐 = 𝑆 → (𝑐 <s 𝑏𝑆 <s 𝑏))
1514ralbidv 3184 . . . . . 6 (𝑐 = 𝑆 → (∀𝑏𝐵 𝑐 <s 𝑏 ↔ ∀𝑏𝐵 𝑆 <s 𝑏))
16 fveq2 6920 . . . . . . 7 (𝑐 = 𝑆 → ( bday 𝑐) = ( bday 𝑆))
1716sseq1d 4040 . . . . . 6 (𝑐 = 𝑆 → (( bday 𝑐) ⊆ 𝑂 ↔ ( bday 𝑆) ⊆ 𝑂))
1813, 15, 173anbi123d 1436 . . . . 5 (𝑐 = 𝑆 → ((∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂) ↔ (∀𝑎𝐴 𝑎 <s 𝑆 ∧ ∀𝑏𝐵 𝑆 <s 𝑏 ∧ ( bday 𝑆) ⊆ 𝑂)))
1918rspcev 3635 . . . 4 ((𝑆 No ∧ (∀𝑎𝐴 𝑎 <s 𝑆 ∧ ∀𝑏𝐵 𝑆 <s 𝑏 ∧ ( bday 𝑆) ⊆ 𝑂)) → ∃𝑐 No (∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂))
20 breq2 5170 . . . . . . 7 (𝑐 = 𝑇 → (𝑎 <s 𝑐𝑎 <s 𝑇))
2120ralbidv 3184 . . . . . 6 (𝑐 = 𝑇 → (∀𝑎𝐴 𝑎 <s 𝑐 ↔ ∀𝑎𝐴 𝑎 <s 𝑇))
22 breq1 5169 . . . . . . 7 (𝑐 = 𝑇 → (𝑐 <s 𝑏𝑇 <s 𝑏))
2322ralbidv 3184 . . . . . 6 (𝑐 = 𝑇 → (∀𝑏𝐵 𝑐 <s 𝑏 ↔ ∀𝑏𝐵 𝑇 <s 𝑏))
24 fveq2 6920 . . . . . . 7 (𝑐 = 𝑇 → ( bday 𝑐) = ( bday 𝑇))
2524sseq1d 4040 . . . . . 6 (𝑐 = 𝑇 → (( bday 𝑐) ⊆ 𝑂 ↔ ( bday 𝑇) ⊆ 𝑂))
2621, 23, 253anbi123d 1436 . . . . 5 (𝑐 = 𝑇 → ((∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂) ↔ (∀𝑎𝐴 𝑎 <s 𝑇 ∧ ∀𝑏𝐵 𝑇 <s 𝑏 ∧ ( bday 𝑇) ⊆ 𝑂)))
2726rspcev 3635 . . . 4 ((𝑇 No ∧ (∀𝑎𝐴 𝑎 <s 𝑇 ∧ ∀𝑏𝐵 𝑇 <s 𝑏 ∧ ( bday 𝑇) ⊆ 𝑂)) → ∃𝑐 No (∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂))
2819, 27jaoi 856 . . 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 579 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 846  w3a 1087   = wceq 1537  wcel 2108  {cab 2717  wral 3067  wrex 3076  Vcvv 3488  cdif 3973  cun 3974  wss 3976  ifcif 4548  {csn 4648  cop 4654   cuni 4931   class class class wbr 5166  cmpt 5249   × cxp 5698  dom cdm 5700  cres 5702  cima 5703  Oncon0 6395  suc csuc 6397  cio 6523  cfv 6573  crio 7403  1oc1o 8515  2oc2o 8516   No csur 27702   <s cslt 27703   bday cbday 27704
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-tp 4653  df-op 4655  df-uni 4932  df-int 4971  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-1o 8522  df-2o 8523  df-no 27705  df-slt 27706  df-bday 27707
This theorem is referenced by:  noeta  27806
  Copyright terms: Public domain W3C validator