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

Theorem noetalem2 27882
Description: Lemma for noeta 27883. 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 3474 . . . 4 (𝐴𝑉𝐴 ∈ V)
21anim2i 628 . . 3 ((𝐴 No 𝐴𝑉) → (𝐴 No 𝐴 ∈ V))
3 elex 3474 . . . 4 (𝐵𝑊𝐵 ∈ V)
43anim2i 628 . . 3 ((𝐵 No 𝐵𝑊) → (𝐵 No 𝐵 ∈ V))
5 id 23 . . 3 (∀𝑎𝐴𝑏𝐵 𝑎 <s 𝑏 → ∀𝑎𝐴𝑏𝐵 𝑎 <s 𝑏)
62, 4, 53anim123i 1167 . 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 2761 . . . 4 (𝑆 ∪ ((suc ( bday 𝐵) ∖ dom 𝑆) × {1o})) = (𝑆 ∪ ((suc ( bday 𝐵) ∖ dom 𝑆) × {1o}))
10 eqid 2761 . . . 4 (𝑇 ∪ ((suc ( bday 𝐴) ∖ dom 𝑇) × {2o})) = (𝑇 ∪ ((suc ( bday 𝐴) ∖ dom 𝑇) × {2o}))
117, 8, 9, 10noetalem1 27881 . . 3 ((((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ ∀𝑎𝐴𝑏𝐵 𝑎 <s 𝑏) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂)) → ((𝑆 No ∧ (∀𝑎𝐴 𝑎 <s 𝑆 ∧ ∀𝑏𝐵 𝑆 <s 𝑏 ∧ ( bday 𝑆) ⊆ 𝑂)) ∨ (𝑇 No ∧ (∀𝑎𝐴 𝑎 <s 𝑇 ∧ ∀𝑏𝐵 𝑇 <s 𝑏 ∧ ( bday 𝑇) ⊆ 𝑂))))
12 breq2 5112 . . . . . . 7 (𝑐 = 𝑆 → (𝑎 <s 𝑐𝑎 <s 𝑆))
1312ralbidv 3186 . . . . . 6 (𝑐 = 𝑆 → (∀𝑎𝐴 𝑎 <s 𝑐 ↔ ∀𝑎𝐴 𝑎 <s 𝑆))
14 breq1 5111 . . . . . . 7 (𝑐 = 𝑆 → (𝑐 <s 𝑏𝑆 <s 𝑏))
1514ralbidv 3186 . . . . . 6 (𝑐 = 𝑆 → (∀𝑏𝐵 𝑐 <s 𝑏 ↔ ∀𝑏𝐵 𝑆 <s 𝑏))
16 fveq2 6881 . . . . . . 7 (𝑐 = 𝑆 → ( bday 𝑐) = ( bday 𝑆))
1716sseq1d 3967 . . . . . 6 (𝑐 = 𝑆 → (( bday 𝑐) ⊆ 𝑂 ↔ ( bday 𝑆) ⊆ 𝑂))
1813, 15, 173anbi123d 1462 . . . . 5 (𝑐 = 𝑆 → ((∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂) ↔ (∀𝑎𝐴 𝑎 <s 𝑆 ∧ ∀𝑏𝐵 𝑆 <s 𝑏 ∧ ( bday 𝑆) ⊆ 𝑂)))
1918rspcev 3580 . . . 4 ((𝑆 No ∧ (∀𝑎𝐴 𝑎 <s 𝑆 ∧ ∀𝑏𝐵 𝑆 <s 𝑏 ∧ ( bday 𝑆) ⊆ 𝑂)) → ∃𝑐 No (∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂))
20 breq2 5112 . . . . . . 7 (𝑐 = 𝑇 → (𝑎 <s 𝑐𝑎 <s 𝑇))
2120ralbidv 3186 . . . . . 6 (𝑐 = 𝑇 → (∀𝑎𝐴 𝑎 <s 𝑐 ↔ ∀𝑎𝐴 𝑎 <s 𝑇))
22 breq1 5111 . . . . . . 7 (𝑐 = 𝑇 → (𝑐 <s 𝑏𝑇 <s 𝑏))
2322ralbidv 3186 . . . . . 6 (𝑐 = 𝑇 → (∀𝑏𝐵 𝑐 <s 𝑏 ↔ ∀𝑏𝐵 𝑇 <s 𝑏))
24 fveq2 6881 . . . . . . 7 (𝑐 = 𝑇 → ( bday 𝑐) = ( bday 𝑇))
2524sseq1d 3967 . . . . . 6 (𝑐 = 𝑇 → (( bday 𝑐) ⊆ 𝑂 ↔ ( bday 𝑇) ⊆ 𝑂))
2621, 23, 253anbi123d 1462 . . . . 5 (𝑐 = 𝑇 → ((∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂) ↔ (∀𝑎𝐴 𝑎 <s 𝑇 ∧ ∀𝑏𝐵 𝑇 <s 𝑏 ∧ ( bday 𝑇) ⊆ 𝑂)))
2726rspcev 3580 . . . 4 ((𝑇 No ∧ (∀𝑎𝐴 𝑎 <s 𝑇 ∧ ∀𝑏𝐵 𝑇 <s 𝑏 ∧ ( bday 𝑇) ⊆ 𝑂)) → ∃𝑐 No (∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂))
2819, 27jaoi 870 . . 3 (((𝑆 No ∧ (∀𝑎𝐴 𝑎 <s 𝑆 ∧ ∀𝑏𝐵 𝑆 <s 𝑏 ∧ ( bday 𝑆) ⊆ 𝑂)) ∨ (𝑇 No ∧ (∀𝑎𝐴 𝑎 <s 𝑇 ∧ ∀𝑏𝐵 𝑇 <s 𝑏 ∧ ( bday 𝑇) ⊆ 𝑂))) → ∃𝑐 No (∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂))
2911, 28syl 18 . 2 ((((𝐴 No 𝐴 ∈ V) ∧ (𝐵 No 𝐵 ∈ V) ∧ ∀𝑎𝐴𝑏𝐵 𝑎 <s 𝑏) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂)) → ∃𝑐 No (∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂))
306, 29sylan 591 1 ((((𝐴 No 𝐴𝑉) ∧ (𝐵 No 𝐵𝑊) ∧ ∀𝑎𝐴𝑏𝐵 𝑎 <s 𝑏) ∧ (𝑂 ∈ On ∧ ( bday “ (𝐴𝐵)) ⊆ 𝑂)) → ∃𝑐 No (∀𝑎𝐴 𝑎 <s 𝑐 ∧ ∀𝑏𝐵 𝑐 <s 𝑏 ∧ ( bday 𝑐) ⊆ 𝑂))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  wo 860  w3a 1101   = wceq 1568  wcel 2141  {cab 2739  wral 3077  wrex 3087  Vcvv 3453  cdif 3901  cun 3902  wss 3904  ifcif 4486  {csn 4588  cop 4594   cuni 4871   class class class wbr 5108  cmpt 5191   × cxp 5659  dom cdm 5661  cres 5663  cima 5664  Oncon0 6360  suc csuc 6362  cio 6490  cfv 6536  crio 7366  1oc1o 8445  2oc2o 8446   No csur 27780   <s clts 27781   bday cbday 27782
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4595  df-uni 4872  df-int 4912  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ord 6363  df-on 6364  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-1o 8452  df-2o 8453  df-no 27783  df-lts 27784  df-bday 27785
This theorem is referenced by:  noeta  27883
  Copyright terms: Public domain W3C validator