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

Theorem nolesgn2o 28085
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 1211 . . . . . 6 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o)) → 𝐵 ∈ No)
2 nofv 28071 . . . . . 6 (𝐵 ∈ No → ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o ∨ (𝐵‘𝑋) = 2o))
31, 2syl 18 . . . . 5 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o)) → ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o ∨ (𝐵‘𝑋) = 2o))
4 3orel3 1517 . . . . 5 (¬ (𝐵‘𝑋) = 2o → (((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o ∨ (𝐵‘𝑋) = 2o) → ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o)))
53, 4syl5com 32 . . . 4 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o)) → (¬ (𝐵‘𝑋) = 2o → ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o)))
6 simp13 1224 . . . . . . 7 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o)) → 𝑋 ∈ On)
7 fveq1 6915 . . . . . . . . . . . . 13 ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) → ((𝐴 ↾ 𝑋)‘𝑦) = ((𝐵 ↾ 𝑋)‘𝑦))
87eqcomd 2769 . . . . . . . . . . . 12 ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) → ((𝐵 ↾ 𝑋)‘𝑦) = ((𝐴 ↾ 𝑋)‘𝑦))
98adantr 486 . . . . . . . . . . 11 (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ 𝑦 ∈ 𝑋) → ((𝐵 ↾ 𝑋)‘𝑦) = ((𝐴 ↾ 𝑋)‘𝑦))
10 simpr 490 . . . . . . . . . . . 12 (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ 𝑦 ∈ 𝑋) → 𝑦 ∈ 𝑋)
1110fvresd 6936 . . . . . . . . . . 11 (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ 𝑦 ∈ 𝑋) → ((𝐵 ↾ 𝑋)‘𝑦) = (𝐵‘𝑦))
1210fvresd 6936 . . . . . . . . . . 11 (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ 𝑦 ∈ 𝑋) → ((𝐴 ↾ 𝑋)‘𝑦) = (𝐴‘𝑦))
139, 11, 123eqtr3d 2806 . . . . . . . . . 10 (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ 𝑦 ∈ 𝑋) → (𝐵‘𝑦) = (𝐴‘𝑦))
1413ralrimiva 3158 . . . . . . . . 9 ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) → ∀𝑦 ∈ 𝑋 (𝐵‘𝑦) = (𝐴‘𝑦))
1514adantr 486 . . . . . . . 8 (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) → ∀𝑦 ∈ 𝑋 (𝐵‘𝑦) = (𝐴‘𝑦))
16153ad2ant2 1152 . . . . . . 7 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o)) → ∀𝑦 ∈ 𝑋 (𝐵‘𝑦) = (𝐴‘𝑦))
17 simprr 785 . . . . . . . . . . . . 13 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o)) → (𝐴‘𝑋) = 2o)
1817a1d 26 . . . . . . . . . . . 12 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o)) → ((𝐵‘𝑋) = ∅ → (𝐴‘𝑋) = 2o))
1918ancld 560 . . . . . . . . . . 11 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o)) → ((𝐵‘𝑋) = ∅ → ((𝐵‘𝑋) = ∅ ∧ (𝐴‘𝑋) = 2o)))
2017a1d 26 . . . . . . . . . . . 12 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o)) → ((𝐵‘𝑋) = 1o → (𝐴‘𝑋) = 2o))
2120ancld 560 . . . . . . . . . . 11 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o)) → ((𝐵‘𝑋) = 1o → ((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = 2o)))
2219, 21orim12d 979 . . . . . . . . . 10 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o)) → (((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o) → (((𝐵‘𝑋) = ∅ ∧ (𝐴‘𝑋) = 2o) ∨ ((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = 2o))))
23223impia 1135 . . . . . . . . 9 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o)) → (((𝐵‘𝑋) = ∅ ∧ (𝐴‘𝑋) = 2o) ∨ ((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = 2o)))
24 3mix3 1351 . . . . . . . . . 10 (((𝐵‘𝑋) = ∅ ∧ (𝐴‘𝑋) = 2o) → (((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = ∅) ∨ ((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = 2o) ∨ ((𝐵‘𝑋) = ∅ ∧ (𝐴‘𝑋) = 2o)))
25 3mix2 1350 . . . . . . . . . 10 (((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = 2o) → (((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = ∅) ∨ ((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = 2o) ∨ ((𝐵‘𝑋) = ∅ ∧ (𝐴‘𝑋) = 2o)))
2624, 25jaoi 871 . . . . . . . . 9 ((((𝐵‘𝑋) = ∅ ∧ (𝐴‘𝑋) = 2o) ∨ ((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = 2o)) → (((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = ∅) ∨ ((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = 2o) ∨ ((𝐵‘𝑋) = ∅ ∧ (𝐴‘𝑋) = 2o)))
2723, 26syl 18 . . . . . . . 8 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o)) → (((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = ∅) ∨ ((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = 2o) ∨ ((𝐵‘𝑋) = ∅ ∧ (𝐴‘𝑋) = 2o)))
28 fvex 6929 . . . . . . . . 9 (𝐵‘𝑋) ∈ V
29 fvex 6929 . . . . . . . . 9 (𝐴‘𝑋) ∈ V
3028, 29brtp 5504 . . . . . . . 8 ((𝐵‘𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴‘𝑋) ↔ (((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = ∅) ∨ ((𝐵‘𝑋) = 1o ∧ (𝐴‘𝑋) = 2o) ∨ ((𝐵‘𝑋) = ∅ ∧ (𝐴‘𝑋) = 2o)))
3127, 30sylibr 237 . . . . . . 7 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o)) → (𝐵‘𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴‘𝑋))
32 raleq 3320 . . . . . . . . 9 (𝑥 = 𝑋 → (∀𝑦 ∈ 𝑥 (𝐵‘𝑦) = (𝐴‘𝑦) ↔ ∀𝑦 ∈ 𝑋 (𝐵‘𝑦) = (𝐴‘𝑦)))
33 fveq2 6916 . . . . . . . . . 10 (𝑥 = 𝑋 → (𝐵‘𝑥) = (𝐵‘𝑋))
34 fveq2 6916 . . . . . . . . . 10 (𝑥 = 𝑋 → (𝐴‘𝑥) = (𝐴‘𝑋))
3533, 34breq12d 5121 . . . . . . . . 9 (𝑥 = 𝑋 → ((𝐵‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴‘𝑥) ↔ (𝐵‘𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴‘𝑋)))
3632, 35anbi12d 644 . . . . . . . 8 (𝑥 = 𝑋 → ((∀𝑦 ∈ 𝑥 (𝐵‘𝑦) = (𝐴‘𝑦) ∧ (𝐵‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴‘𝑥)) ↔ (∀𝑦 ∈ 𝑋 (𝐵‘𝑦) = (𝐴‘𝑦) ∧ (𝐵‘𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴‘𝑋))))
3736rspcev 3580 . . . . . . 7 ((𝑋 ∈ On ∧ (∀𝑦 ∈ 𝑋 (𝐵‘𝑦) = (𝐴‘𝑦) ∧ (𝐵‘𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴‘𝑋))) → ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐵‘𝑦) = (𝐴‘𝑦) ∧ (𝐵‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴‘𝑥)))
386, 16, 31, 37syl12anc 850 . . . . . 6 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o)) → ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐵‘𝑦) = (𝐴‘𝑦) ∧ (𝐵‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴‘𝑥)))
39 simp12 1223 . . . . . . 7 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o)) → 𝐵 ∈ No)
40 simp11 1222 . . . . . . 7 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o)) → 𝐴 ∈ No)
41 ltsval 28061 . . . . . . 7 ((𝐵 ∈ No ∧ 𝐴 ∈ No) → (𝐵 <s 𝐴 ↔ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐵‘𝑦) = (𝐴‘𝑦) ∧ (𝐵‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴‘𝑥))))
4239, 40, 41syl2anc 596 . . . . . 6 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o)) → (𝐵 <s 𝐴 ↔ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐵‘𝑦) = (𝐴‘𝑦) ∧ (𝐵‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐴‘𝑥))))
4338, 42mpbird 260 . . . . 5 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o)) → 𝐵 <s 𝐴)
44433expia 1139 . . . 4 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o)) → (((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o) → 𝐵 <s 𝐴))
455, 44syld 48 . . 3 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o)) → (¬ (𝐵‘𝑋) = 2o → 𝐵 <s 𝐴))
4645con1d 146 . 2 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o)) → (¬ 𝐵 <s 𝐴 → (𝐵‘𝑋) = 2o))
47463impia 1135 1 (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 2o) ∧ ¬ 𝐵 <s 𝐴) → (𝐵‘𝑋) = 2o)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∨ w3o 1102   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ∅c0 4281  {ctp 4592  ⟨cop 4840   class class class wbr 5108   ↾ cres 5660  Oncon0 6388  ‘cfv 6566  1oc1o 8507  2oc2o 8508  Nocsur 28054   <s clts 28055
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-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ord 6391  df-on 6392  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-1o 8514  df-2o 8515  df-no 28057  df-lts 28058
This theorem is used by:  nolesgn2ores  28086
  Copyright terms: Public domain W3C validator