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

Theorem nolesgn2o 27651
Description: Given 𝐴 less-than or equal to 𝐵, equal to 𝐵 up to 𝑋, and 𝐴(𝑋) = 2o, then 𝐵(𝑋) = 2o. (Contributed by Scott Fenton, 6-Dec-2021.)
Assertion
Ref Expression
nolesgn2o (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝐵𝑋) = 2o)

Proof of Theorem nolesgn2o
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl2 1194 . . . . . 6 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o)) → 𝐵 No )
2 nofv 27637 . . . . . 6 (𝐵 No → ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o ∨ (𝐵𝑋) = 2o))
31, 2syl 17 . . . . 5 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o)) → ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o ∨ (𝐵𝑋) = 2o))
4 3orel3 1489 . . . . 5 (¬ (𝐵𝑋) = 2o → (((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o ∨ (𝐵𝑋) = 2o) → ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o)))
53, 4syl5com 31 . . . 4 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o)) → (¬ (𝐵𝑋) = 2o → ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o)))
6 simp13 1207 . . . . . . 7 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o)) → 𝑋 ∈ On)
7 fveq1 6841 . . . . . . . . . . . . 13 ((𝐴𝑋) = (𝐵𝑋) → ((𝐴𝑋)‘𝑦) = ((𝐵𝑋)‘𝑦))
87eqcomd 2743 . . . . . . . . . . . 12 ((𝐴𝑋) = (𝐵𝑋) → ((𝐵𝑋)‘𝑦) = ((𝐴𝑋)‘𝑦))
98adantr 480 . . . . . . . . . . 11 (((𝐴𝑋) = (𝐵𝑋) ∧ 𝑦𝑋) → ((𝐵𝑋)‘𝑦) = ((𝐴𝑋)‘𝑦))
10 simpr 484 . . . . . . . . . . . 12 (((𝐴𝑋) = (𝐵𝑋) ∧ 𝑦𝑋) → 𝑦𝑋)
1110fvresd 6862 . . . . . . . . . . 11 (((𝐴𝑋) = (𝐵𝑋) ∧ 𝑦𝑋) → ((𝐵𝑋)‘𝑦) = (𝐵𝑦))
1210fvresd 6862 . . . . . . . . . . 11 (((𝐴𝑋) = (𝐵𝑋) ∧ 𝑦𝑋) → ((𝐴𝑋)‘𝑦) = (𝐴𝑦))
139, 11, 123eqtr3d 2780 . . . . . . . . . 10 (((𝐴𝑋) = (𝐵𝑋) ∧ 𝑦𝑋) → (𝐵𝑦) = (𝐴𝑦))
1413ralrimiva 3130 . . . . . . . . 9 ((𝐴𝑋) = (𝐵𝑋) → ∀𝑦𝑋 (𝐵𝑦) = (𝐴𝑦))
1514adantr 480 . . . . . . . 8 (((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) → ∀𝑦𝑋 (𝐵𝑦) = (𝐴𝑦))
16153ad2ant2 1135 . . . . . . 7 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o)) → ∀𝑦𝑋 (𝐵𝑦) = (𝐴𝑦))
17 simprr 773 . . . . . . . . . . . . 13 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o)) → (𝐴𝑋) = 2o)
1817a1d 25 . . . . . . . . . . . 12 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o)) → ((𝐵𝑋) = ∅ → (𝐴𝑋) = 2o))
1918ancld 550 . . . . . . . . . . 11 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o)) → ((𝐵𝑋) = ∅ → ((𝐵𝑋) = ∅ ∧ (𝐴𝑋) = 2o)))
2017a1d 25 . . . . . . . . . . . 12 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o)) → ((𝐵𝑋) = 1o → (𝐴𝑋) = 2o))
2120ancld 550 . . . . . . . . . . 11 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o)) → ((𝐵𝑋) = 1o → ((𝐵𝑋) = 1o ∧ (𝐴𝑋) = 2o)))
2219, 21orim12d 967 . . . . . . . . . 10 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o)) → (((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o) → (((𝐵𝑋) = ∅ ∧ (𝐴𝑋) = 2o) ∨ ((𝐵𝑋) = 1o ∧ (𝐴𝑋) = 2o))))
23223impia 1118 . . . . . . . . 9 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o)) → (((𝐵𝑋) = ∅ ∧ (𝐴𝑋) = 2o) ∨ ((𝐵𝑋) = 1o ∧ (𝐴𝑋) = 2o)))
24 3mix3 1334 . . . . . . . . . 10 (((𝐵𝑋) = ∅ ∧ (𝐴𝑋) = 2o) → (((𝐵𝑋) = 1o ∧ (𝐴𝑋) = ∅) ∨ ((𝐵𝑋) = 1o ∧ (𝐴𝑋) = 2o) ∨ ((𝐵𝑋) = ∅ ∧ (𝐴𝑋) = 2o)))
25 3mix2 1333 . . . . . . . . . 10 (((𝐵𝑋) = 1o ∧ (𝐴𝑋) = 2o) → (((𝐵𝑋) = 1o ∧ (𝐴𝑋) = ∅) ∨ ((𝐵𝑋) = 1o ∧ (𝐴𝑋) = 2o) ∨ ((𝐵𝑋) = ∅ ∧ (𝐴𝑋) = 2o)))
2624, 25jaoi 858 . . . . . . . . 9 ((((𝐵𝑋) = ∅ ∧ (𝐴𝑋) = 2o) ∨ ((𝐵𝑋) = 1o ∧ (𝐴𝑋) = 2o)) → (((𝐵𝑋) = 1o ∧ (𝐴𝑋) = ∅) ∨ ((𝐵𝑋) = 1o ∧ (𝐴𝑋) = 2o) ∨ ((𝐵𝑋) = ∅ ∧ (𝐴𝑋) = 2o)))
2723, 26syl 17 . . . . . . . 8 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o)) → (((𝐵𝑋) = 1o ∧ (𝐴𝑋) = ∅) ∨ ((𝐵𝑋) = 1o ∧ (𝐴𝑋) = 2o) ∨ ((𝐵𝑋) = ∅ ∧ (𝐴𝑋) = 2o)))
28 fvex 6855 . . . . . . . . 9 (𝐵𝑋) ∈ V
29 fvex 6855 . . . . . . . . 9 (𝐴𝑋) ∈ V
3028, 29brtp 5479 . . . . . . . 8 ((𝐵𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴𝑋) ↔ (((𝐵𝑋) = 1o ∧ (𝐴𝑋) = ∅) ∨ ((𝐵𝑋) = 1o ∧ (𝐴𝑋) = 2o) ∨ ((𝐵𝑋) = ∅ ∧ (𝐴𝑋) = 2o)))
3127, 30sylibr 234 . . . . . . 7 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o)) → (𝐵𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴𝑋))
32 raleq 3295 . . . . . . . . 9 (𝑥 = 𝑋 → (∀𝑦𝑥 (𝐵𝑦) = (𝐴𝑦) ↔ ∀𝑦𝑋 (𝐵𝑦) = (𝐴𝑦)))
33 fveq2 6842 . . . . . . . . . 10 (𝑥 = 𝑋 → (𝐵𝑥) = (𝐵𝑋))
34 fveq2 6842 . . . . . . . . . 10 (𝑥 = 𝑋 → (𝐴𝑥) = (𝐴𝑋))
3533, 34breq12d 5113 . . . . . . . . 9 (𝑥 = 𝑋 → ((𝐵𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴𝑥) ↔ (𝐵𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴𝑋)))
3632, 35anbi12d 633 . . . . . . . 8 (𝑥 = 𝑋 → ((∀𝑦𝑥 (𝐵𝑦) = (𝐴𝑦) ∧ (𝐵𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴𝑥)) ↔ (∀𝑦𝑋 (𝐵𝑦) = (𝐴𝑦) ∧ (𝐵𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴𝑋))))
3736rspcev 3578 . . . . . . 7 ((𝑋 ∈ On ∧ (∀𝑦𝑋 (𝐵𝑦) = (𝐴𝑦) ∧ (𝐵𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴𝑋))) → ∃𝑥 ∈ On (∀𝑦𝑥 (𝐵𝑦) = (𝐴𝑦) ∧ (𝐵𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴𝑥)))
386, 16, 31, 37syl12anc 837 . . . . . 6 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o)) → ∃𝑥 ∈ On (∀𝑦𝑥 (𝐵𝑦) = (𝐴𝑦) ∧ (𝐵𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴𝑥)))
39 simp12 1206 . . . . . . 7 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o)) → 𝐵 No )
40 simp11 1205 . . . . . . 7 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o)) → 𝐴 No )
41 ltsval 27627 . . . . . . 7 ((𝐵 No 𝐴 No ) → (𝐵 <s 𝐴 ↔ ∃𝑥 ∈ On (∀𝑦𝑥 (𝐵𝑦) = (𝐴𝑦) ∧ (𝐵𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴𝑥))))
4239, 40, 41syl2anc 585 . . . . . 6 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o)) → (𝐵 <s 𝐴 ↔ ∃𝑥 ∈ On (∀𝑦𝑥 (𝐵𝑦) = (𝐴𝑦) ∧ (𝐵𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴𝑥))))
4338, 42mpbird 257 . . . . 5 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) ∧ ((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o)) → 𝐵 <s 𝐴)
44433expia 1122 . . . 4 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o)) → (((𝐵𝑋) = ∅ ∨ (𝐵𝑋) = 1o) → 𝐵 <s 𝐴))
455, 44syld 47 . . 3 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o)) → (¬ (𝐵𝑋) = 2o𝐵 <s 𝐴))
4645con1d 145 . 2 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o)) → (¬ 𝐵 <s 𝐴 → (𝐵𝑋) = 2o))
47463impia 1118 1 (((𝐴 No 𝐵 No 𝑋 ∈ On) ∧ ((𝐴𝑋) = (𝐵𝑋) ∧ (𝐴𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝐵𝑋) = 2o)
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 3062  c0 4287  {ctp 4586  cop 4588   class class class wbr 5100  cres 5634  Oncon0 6325  cfv 6500  1oc1o 8400  2oc2o 8401   No csur 27619   <s clts 27620
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 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ord 6328  df-on 6329  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-fv 6508  df-1o 8407  df-2o 8408  df-no 27622  df-lts 27623
This theorem is referenced by:  nolesgn2ores  27652
  Copyright terms: Public domain W3C validator