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

Theorem etaslts 28212
Description: A restatement of noeta 28133 using set less-than. (Contributed by Scott Fenton, 10-Aug-2024.)
Assertion
Ref Expression
etaslts ((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On ∧ (bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂) → ∃𝑥 ∈ No (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ (bday‘𝑥) ⊆ 𝑂))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑂

Proof of Theorem etaslts
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sltsss1 28184 . . . . . 6 (𝐴 <<s 𝐵 → 𝐴 ⊆ No)
2 sltsex1 28182 . . . . . 6 (𝐴 <<s 𝐵 → 𝐴 ∈ V)
31, 2jca 521 . . . . 5 (𝐴 <<s 𝐵 → (𝐴 ⊆ No ∧ 𝐴 ∈ V))
4 sltsss2 28185 . . . . . 6 (𝐴 <<s 𝐵 → 𝐵 ⊆ No)
5 sltsex2 28183 . . . . . 6 (𝐴 <<s 𝐵 → 𝐵 ∈ V)
64, 5jca 521 . . . . 5 (𝐴 <<s 𝐵 → (𝐵 ⊆ No ∧ 𝐵 ∈ V))
7 sltssep 28186 . . . . 5 (𝐴 <<s 𝐵 → ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 𝑦 <s 𝑧)
83, 6, 73jca 1146 . . . 4 (𝐴 <<s 𝐵 → ((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 𝑦 <s 𝑧))
983ad2ant1 1151 . . 3 ((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On ∧ (bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂) → ((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 𝑦 <s 𝑧))
10 3simpc 1168 . . 3 ((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On ∧ (bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂) → (𝑂 ∈ On ∧ (bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂))
11 noeta 28133 . . 3 ((((𝐴 ⊆ No ∧ 𝐴 ∈ V) ∧ (𝐵 ⊆ No ∧ 𝐵 ∈ V) ∧ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 𝑦 <s 𝑧) ∧ (𝑂 ∈ On ∧ (bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂)) → ∃𝑥 ∈ No (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))
129, 10, 11syl2anc 596 . 2 ((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On ∧ (bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂) → ∃𝑥 ∈ No (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))
132ad2antrr 739 . . . . . . . 8 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → 𝐴 ∈ V)
14 vsnex 5398 . . . . . . . 8 {𝑥} ∈ V
1513, 14jctir 530 . . . . . . 7 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → (𝐴 ∈ V ∧ {𝑥} ∈ V))
161ad2antrr 739 . . . . . . . 8 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → 𝐴 ⊆ No)
17 snssi 4746 . . . . . . . . 9 (𝑥 ∈ No → {𝑥} ⊆ No)
1817ad2antrl 741 . . . . . . . 8 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → {𝑥} ⊆ No)
19 simprr1 1240 . . . . . . . . 9 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → ∀𝑦 ∈ 𝐴 𝑦 <s 𝑥)
20 vex 3458 . . . . . . . . . . 11 𝑥 ∈ V
21 breq2 5110 . . . . . . . . . . 11 (𝑧 = 𝑥 → (𝑦 <s 𝑧 ↔ 𝑦 <s 𝑥))
2220, 21ralsn 4642 . . . . . . . . . 10 (∀𝑧 ∈ {𝑥}𝑦 <s 𝑧 ↔ 𝑦 <s 𝑥)
2322ralbii 3112 . . . . . . . . 9 (∀𝑦 ∈ 𝐴 ∀𝑧 ∈ {𝑥}𝑦 <s 𝑧 ↔ ∀𝑦 ∈ 𝐴 𝑦 <s 𝑥)
2419, 23sylibr 237 . . . . . . . 8 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ {𝑥}𝑦 <s 𝑧)
2516, 18, 243jca 1146 . . . . . . 7 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → (𝐴 ⊆ No ∧ {𝑥} ⊆ No ∧ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ {𝑥}𝑦 <s 𝑧))
26 brslts 28181 . . . . . . 7 (𝐴 <<s {𝑥} ↔ ((𝐴 ∈ V ∧ {𝑥} ∈ V) ∧ (𝐴 ⊆ No ∧ {𝑥} ⊆ No ∧ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ {𝑥}𝑦 <s 𝑧)))
2715, 25, 26sylanbrc 595 . . . . . 6 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → 𝐴 <<s {𝑥})
285ad2antrr 739 . . . . . . . 8 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → 𝐵 ∈ V)
2928, 14jctil 529 . . . . . . 7 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → ({𝑥} ∈ V ∧ 𝐵 ∈ V))
304ad2antrr 739 . . . . . . . 8 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → 𝐵 ⊆ No)
31 simprr2 1241 . . . . . . . . 9 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧)
32 breq1 5109 . . . . . . . . . . 11 (𝑦 = 𝑥 → (𝑦 <s 𝑧 ↔ 𝑥 <s 𝑧))
3332ralbidv 3189 . . . . . . . . . 10 (𝑦 = 𝑥 → (∀𝑧 ∈ 𝐵 𝑦 <s 𝑧 ↔ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧))
3420, 33ralsn 4642 . . . . . . . . 9 (∀𝑦 ∈ {𝑥}∀𝑧 ∈ 𝐵 𝑦 <s 𝑧 ↔ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧)
3531, 34sylibr 237 . . . . . . . 8 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → ∀𝑦 ∈ {𝑥}∀𝑧 ∈ 𝐵 𝑦 <s 𝑧)
3618, 30, 353jca 1146 . . . . . . 7 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → ({𝑥} ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑦 ∈ {𝑥}∀𝑧 ∈ 𝐵 𝑦 <s 𝑧))
37 brslts 28181 . . . . . . 7 ({𝑥} <<s 𝐵 ↔ (({𝑥} ∈ V ∧ 𝐵 ∈ V) ∧ ({𝑥} ⊆ No ∧ 𝐵 ⊆ No ∧ ∀𝑦 ∈ {𝑥}∀𝑧 ∈ 𝐵 𝑦 <s 𝑧)))
3829, 36, 37sylanbrc 595 . . . . . 6 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → {𝑥} <<s 𝐵)
39 simprr3 1242 . . . . . 6 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → (bday‘𝑥) ⊆ 𝑂)
4027, 38, 393jca 1146 . . . . 5 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ (𝑥 ∈ No ∧ (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂))) → (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ (bday‘𝑥) ⊆ 𝑂))
4140expr 462 . . . 4 (((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) ∧ 𝑥 ∈ No) → ((∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂) → (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ (bday‘𝑥) ⊆ 𝑂)))
4241reximdva 3179 . . 3 ((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On) → (∃𝑥 ∈ No (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂) → ∃𝑥 ∈ No (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ (bday‘𝑥) ⊆ 𝑂)))
43423adant3 1150 . 2 ((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On ∧ (bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂) → (∃𝑥 ∈ No (∀𝑦 ∈ 𝐴 𝑦 <s 𝑥 ∧ ∀𝑧 ∈ 𝐵 𝑥 <s 𝑧 ∧ (bday‘𝑥) ⊆ 𝑂) → ∃𝑥 ∈ No (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ (bday‘𝑥) ⊆ 𝑂)))
4412, 43mpd 16 1 ((𝐴 <<s 𝐵 ∧ 𝑂 ∈ On ∧ (bday “ (𝐴 ∪ 𝐵)) ⊆ 𝑂) → ∃𝑥 ∈ No (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵 ∧ (bday‘𝑥) ⊆ 𝑂))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  {csn 4588   class class class wbr 5106   “ cima 5659  Oncon0 6383  ‘cfv 6561  Nocsur 28030   <s clts 28031  bdaycbday 28032   <<s cslts 28176
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-int 4911  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-ord 6386  df-on 6387  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7403  df-1o 8507  df-2o 8508  df-no 28033  df-lts 28034  df-bday 28035  df-slts 28177
This theorem is used by:  etaslts2  28213  cutbdaybnd  28214
  Copyright terms: Public domain W3C validator