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

Theorem nogesgn1o 27646
Description: Given 𝐴 greater than or equal to 𝐵, equal to 𝐵 up to 𝑋, and 𝐴(𝑋) = 1o, then 𝐵(𝑋) = 1o. (Contributed by Scott Fenton, 9-Aug-2024.)
Assertion
Ref Expression
nogesgn1o (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝐵𝑋) = 1o)

Proof of Theorem nogesgn1o
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl2 1194 . . . . . 6 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o)) → 𝐵 No )
2 nofv 27630 . . . . . 6 (𝐵 No → ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o ∨ (𝐵𝑋) = 2o))
31, 2syl 17 . . . . 5 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o)) → ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o ∨ (𝐵𝑋) = 2o))
4 3orel2 1487 . . . . 5 (¬ (𝐵𝑋) = 1o → (((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o ∨ (𝐵𝑋) = 2o) → ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)))
53, 4syl5com 31 . . . 4 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o)) → (¬ (𝐵𝑋) = 1o → ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)))
6 simp13 1207 . . . . . . 7 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → 𝑋 ∈ On)
7 fveq1 6834 . . . . . . . . . . . 12 ((𝐴𝑋) = (𝐵𝑋) → ((𝐴𝑋)‘𝑦) = ((𝐵𝑋)‘𝑦))
87adantr 480 . . . . . . . . . . 11 (((𝐴𝑋) = (𝐵𝑋) ∧ 𝑦𝑋) → ((𝐴𝑋)‘𝑦) = ((𝐵𝑋)‘𝑦))
9 simpr 484 . . . . . . . . . . . 12 (((𝐴𝑋) = (𝐵𝑋) ∧ 𝑦𝑋) → 𝑦𝑋)
109fvresd 6855 . . . . . . . . . . 11 (((𝐴𝑋) = (𝐵𝑋) ∧ 𝑦𝑋) → ((𝐴𝑋)‘𝑦) = (𝐴𝑦))
119fvresd 6855 . . . . . . . . . . 11 (((𝐴𝑋) = (𝐵𝑋) ∧ 𝑦𝑋) → ((𝐵𝑋)‘𝑦) = (𝐵𝑦))
128, 10, 113eqtr3d 2780 . . . . . . . . . 10 (((𝐴𝑋) = (𝐵𝑋) ∧ 𝑦𝑋) → (𝐴𝑦) = (𝐵𝑦))
1312ralrimiva 3129 . . . . . . . . 9 ((𝐴𝑋) = (𝐵𝑋) → ∀𝑦𝑋 (𝐴𝑦) = (𝐵𝑦))
1413adantr 480 . . . . . . . 8 (((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) → ∀𝑦𝑋 (𝐴𝑦) = (𝐵𝑦))
15143ad2ant2 1135 . . . . . . 7 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → ∀𝑦𝑋 (𝐴𝑦) = (𝐵𝑦))
16 simp2r 1202 . . . . . . . . . . 11 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → (𝐴𝑋) = 1o)
17 simp3 1139 . . . . . . . . . . 11 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o))
1816, 17jca 511 . . . . . . . . . 10 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → ((𝐴𝑋) = 1o ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)))
19 andi 1010 . . . . . . . . . 10 (((𝐴𝑋) = 1o ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) ↔ (((𝐴𝑋) = 1o ∧ (𝐵𝑋) = ∅) ∨ ((𝐴𝑋) = 1o ∧ (𝐵𝑋) = 2o)))
2018, 19sylib 218 . . . . . . . . 9 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → (((𝐴𝑋) = 1o ∧ (𝐵𝑋) = ∅) ∨ ((𝐴𝑋) = 1o ∧ (𝐵𝑋) = 2o)))
21 3mix1 1332 . . . . . . . . . 10 (((𝐴𝑋) = 1o ∧ (𝐵𝑋) = ∅) → (((𝐴𝑋) = 1o ∧ (𝐵𝑋) = ∅) ∨ ((𝐴𝑋) = 1o ∧ (𝐵𝑋) = 2o) ∨ ((𝐴𝑋) = ∅ ∧ (𝐵𝑋) = 2o)))
22 3mix2 1333 . . . . . . . . . 10 (((𝐴𝑋) = 1o ∧ (𝐵𝑋) = 2o) → (((𝐴𝑋) = 1o ∧ (𝐵𝑋) = ∅) ∨ ((𝐴𝑋) = 1o ∧ (𝐵𝑋) = 2o) ∨ ((𝐴𝑋) = ∅ ∧ (𝐵𝑋) = 2o)))
2321, 22jaoi 858 . . . . . . . . 9 ((((𝐴𝑋) = 1o ∧ (𝐵𝑋) = ∅) ∨ ((𝐴𝑋) = 1o ∧ (𝐵𝑋) = 2o)) → (((𝐴𝑋) = 1o ∧ (𝐵𝑋) = ∅) ∨ ((𝐴𝑋) = 1o ∧ (𝐵𝑋) = 2o) ∨ ((𝐴𝑋) = ∅ ∧ (𝐵𝑋) = 2o)))
2420, 23syl 17 . . . . . . . 8 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → (((𝐴𝑋) = 1o ∧ (𝐵𝑋) = ∅) ∨ ((𝐴𝑋) = 1o ∧ (𝐵𝑋) = 2o) ∨ ((𝐴𝑋) = ∅ ∧ (𝐵𝑋) = 2o)))
25 fvex 6848 . . . . . . . . 9 (𝐴𝑋) ∈ V
26 fvex 6848 . . . . . . . . 9 (𝐵𝑋) ∈ V
2725, 26brtp 5472 . . . . . . . 8 ((𝐴𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑋) ↔ (((𝐴𝑋) = 1o ∧ (𝐵𝑋) = ∅) ∨ ((𝐴𝑋) = 1o ∧ (𝐵𝑋) = 2o) ∨ ((𝐴𝑋) = ∅ ∧ (𝐵𝑋) = 2o)))
2824, 27sylibr 234 . . . . . . 7 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → (𝐴𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑋))
29 raleq 3294 . . . . . . . . 9 (𝑥 = 𝑋 → (∀𝑦𝑥 (𝐴𝑦) = (𝐵𝑦) ↔ ∀𝑦𝑋 (𝐴𝑦) = (𝐵𝑦)))
30 fveq2 6835 . . . . . . . . . 10 (𝑥 = 𝑋 → (𝐴𝑥) = (𝐴𝑋))
31 fveq2 6835 . . . . . . . . . 10 (𝑥 = 𝑋 → (𝐵𝑥) = (𝐵𝑋))
3230, 31breq12d 5112 . . . . . . . . 9 (𝑥 = 𝑋 → ((𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑥) ↔ (𝐴𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑋)))
3329, 32anbi12d 633 . . . . . . . 8 (𝑥 = 𝑋 → ((∀𝑦𝑥 (𝐴𝑦) = (𝐵𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑥)) ↔ (∀𝑦𝑋 (𝐴𝑦) = (𝐵𝑦) ∧ (𝐴𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑋))))
3433rspcev 3577 . . . . . . 7 ((𝑋 ∈ On ∧ (∀𝑦𝑋 (𝐴𝑦) = (𝐵𝑦) ∧ (𝐴𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑋))) → ∃𝑥 ∈ On (∀𝑦𝑥 (𝐴𝑦) = (𝐵𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑥)))
356, 15, 28, 34syl12anc 837 . . . . . 6 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → ∃𝑥 ∈ On (∀𝑦𝑥 (𝐴𝑦) = (𝐵𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑥)))
36 simp11 1205 . . . . . . 7 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → 𝐴 No )
37 simp12 1206 . . . . . . 7 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → 𝐵 No )
38 ltsval 27620 . . . . . . 7 ((𝐴 No 𝐵 No ) → (𝐴 <s 𝐵 ↔ ∃𝑥 ∈ On (∀𝑦𝑥 (𝐴𝑦) = (𝐵𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑥))))
3936, 37, 38syl2anc 585 . . . . . 6 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → (𝐴 <s 𝐵 ↔ ∃𝑥 ∈ On (∀𝑦𝑥 (𝐴𝑦) = (𝐵𝑦) ∧ (𝐴𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵𝑥))))
4035, 39mpbird 257 . . . . 5 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o)) → 𝐴 <s 𝐵)
41403expia 1122 . . . 4 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o)) → (((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 2o) → 𝐴 <s 𝐵))
425, 41syld 47 . . 3 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o)) → (¬ (𝐵𝑋) = 1o𝐴 <s 𝐵))
4342con1d 145 . 2 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o)) → (¬ 𝐴 <s 𝐵 → (𝐵𝑋) = 1o))
44433impia 1118 1 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝐵𝑋) = 1o)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 848  w3o 1086  w3a 1087   = wceq 1542  wcel 2114  wral 3052  wrex 3061  c0 4286  {ctp 4585  cop 4587   class class class wbr 5099  cres 5627  Oncon0 6318  cfv 6493  1oc1o 8393  2oc2o 8394   No csur 27612   <s clts 27613
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-12 2185  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7683
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-ne 2934  df-ral 3053  df-rex 3062  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-tp 4586  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ord 6321  df-on 6322  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-fv 6501  df-1o 8400  df-2o 8401  df-no 27615  df-lts 27616
This theorem is referenced by:  nogesgn1ores  27647
  Copyright terms: Public domain W3C validator