Theorem nogesgn1o 27907

Description: Given 𝐴 greater than or equal to 𝐵, equal to 𝐵 up to 𝑋, and 𝐴(𝑋) = 1_o, then 𝐵(𝑋) = 1_o. (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.

Step	Hyp	Ref	Expression
1		simpl2 1211	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o)) → 𝐵 ∈ No )
2		nofv 27891	. . . . . 6 ⊢ (𝐵 ∈ No → ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o ∨ (𝐵‘𝑋) = 2o))
3	1, 2	syl 18	. . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o)) → ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o ∨ (𝐵‘𝑋) = 2o))
4		3orel2 1515	. . . . 5 ⊢ (¬ (𝐵‘𝑋) = 1o → (((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 1o ∨ (𝐵‘𝑋) = 2o) → ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)))
5	3, 4	syl5com 32	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o)) → (¬ (𝐵‘𝑋) = 1o → ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)))
6		simp13 1224	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → 𝑋 ∈ On)
7		fveq1 6881	. . . . . . . . . . . 12 ⊢ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) → ((𝐴 ↾ 𝑋)‘𝑦) = ((𝐵 ↾ 𝑋)‘𝑦))
8	7	adantr 486	. . . . . . . . . . 11 ⊢ (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ 𝑦 ∈ 𝑋) → ((𝐴 ↾ 𝑋)‘𝑦) = ((𝐵 ↾ 𝑋)‘𝑦))
9		simpr 490	. . . . . . . . . . . 12 ⊢ (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ 𝑦 ∈ 𝑋) → 𝑦 ∈ 𝑋)
10	9	fvresd 6902	. . . . . . . . . . 11 ⊢ (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ 𝑦 ∈ 𝑋) → ((𝐴 ↾ 𝑋)‘𝑦) = (𝐴‘𝑦))
11	9	fvresd 6902	. . . . . . . . . . 11 ⊢ (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ 𝑦 ∈ 𝑋) → ((𝐵 ↾ 𝑋)‘𝑦) = (𝐵‘𝑦))
12	8, 10, 11	3eqtr3d 2805	. . . . . . . . . 10 ⊢ (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ 𝑦 ∈ 𝑋) → (𝐴‘𝑦) = (𝐵‘𝑦))
13	12	ralrimiva 3156	. . . . . . . . 9 ⊢ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) → ∀𝑦 ∈ 𝑋 (𝐴‘𝑦) = (𝐵‘𝑦))
14	13	adantr 486	. . . . . . . 8 ⊢ (((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) → ∀𝑦 ∈ 𝑋 (𝐴‘𝑦) = (𝐵‘𝑦))
15	14	3ad2ant2 1152	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → ∀𝑦 ∈ 𝑋 (𝐴‘𝑦) = (𝐵‘𝑦))
16		simp2r 1219	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → (𝐴‘𝑋) = 1o)
17		simp3 1156	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o))
18	16, 17	jca 521	. . . . . . . . . 10 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → ((𝐴‘𝑋) = 1o ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)))
19		andi 1025	. . . . . . . . . 10 ⊢ (((𝐴‘𝑋) = 1o ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) ↔ (((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = ∅) ∨ ((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = 2o)))
20	18, 19	sylib 221	. . . . . . . . 9 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → (((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = ∅) ∨ ((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = 2o)))
21		3mix1 1349	. . . . . . . . . 10 ⊢ (((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = ∅) → (((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = ∅) ∨ ((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = 2o) ∨ ((𝐴‘𝑋) = ∅ ∧ (𝐵‘𝑋) = 2o)))
22		3mix2 1350	. . . . . . . . . 10 ⊢ (((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = 2o) → (((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = ∅) ∨ ((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = 2o) ∨ ((𝐴‘𝑋) = ∅ ∧ (𝐵‘𝑋) = 2o)))
23	21, 22	jaoi 871	. . . . . . . . 9 ⊢ ((((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = ∅) ∨ ((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = 2o)) → (((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = ∅) ∨ ((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = 2o) ∨ ((𝐴‘𝑋) = ∅ ∧ (𝐵‘𝑋) = 2o)))
24	20, 23	syl 18	. . . . . . . 8 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → (((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = ∅) ∨ ((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = 2o) ∨ ((𝐴‘𝑋) = ∅ ∧ (𝐵‘𝑋) = 2o)))
25		fvex 6895	. . . . . . . . 9 ⊢ (𝐴‘𝑋) ∈ V
26		fvex 6895	. . . . . . . . 9 ⊢ (𝐵‘𝑋) ∈ V
27	25, 26	brtp 5505	. . . . . . . 8 ⊢ ((𝐴‘𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑋) ↔ (((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = ∅) ∨ ((𝐴‘𝑋) = 1o ∧ (𝐵‘𝑋) = 2o) ∨ ((𝐴‘𝑋) = ∅ ∧ (𝐵‘𝑋) = 2o)))
28	24, 27	sylibr 237	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → (𝐴‘𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑋))
29		raleq 3318	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ↔ ∀𝑦 ∈ 𝑋 (𝐴‘𝑦) = (𝐵‘𝑦)))
30		fveq2 6882	. . . . . . . . . 10 ⊢ (𝑥 = 𝑋 → (𝐴‘𝑥) = (𝐴‘𝑋))
31		fveq2 6882	. . . . . . . . . 10 ⊢ (𝑥 = 𝑋 → (𝐵‘𝑥) = (𝐵‘𝑋))
32	30, 31	breq12d 5120	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → ((𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥) ↔ (𝐴‘𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑋)))
33	29, 32	anbi12d 644	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → ((∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥)) ↔ (∀𝑦 ∈ 𝑋 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑋))))
34	33	rspcev 3579	. . . . . . 7 ⊢ ((𝑋 ∈ On ∧ (∀𝑦 ∈ 𝑋 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑋){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑋))) → ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥)))
35	6, 15, 28, 34	syl12anc 850	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥)))
36		simp11 1222	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → 𝐴 ∈ No )
37		simp12 1223	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → 𝐵 ∈ No )
38		ltsval 27881	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 <s 𝐵 ↔ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥))))
39	36, 37, 38	syl2anc 596	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → (𝐴 <s 𝐵 ↔ ∃𝑥 ∈ On (∀𝑦 ∈ 𝑥 (𝐴‘𝑦) = (𝐵‘𝑦) ∧ (𝐴‘𝑥){⟨1o, ∅⟩, ⟨1o, 2o⟩, ⟨∅, 2o⟩} (𝐵‘𝑥))))
40	35, 39	mpbird 260	. . . . 5 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o)) → 𝐴 <s 𝐵)
41	40	3expia 1139	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o)) → (((𝐵‘𝑋) = ∅ ∨ (𝐵‘𝑋) = 2o) → 𝐴 <s 𝐵))
42	5, 41	syld 48	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o)) → (¬ (𝐵‘𝑋) = 1o → 𝐴 <s 𝐵))
43	42	con1d 146	. 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o)) → (¬ 𝐴 <s 𝐵 → (𝐵‘𝑋) = 1o))
44	43	3impia 1135	1 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝑋 ∈ On) ∧ ((𝐴 ↾ 𝑋) = (𝐵 ↾ 𝑋) ∧ (𝐴‘𝑋) = 1o) ∧ ¬ 𝐴 <s 𝐵) → (𝐵‘𝑋) = 1o)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∨ w3o 1102   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088  ∅c0 4282  {ctp 4591  ⟨cop 4593   class class class wbr 5107   ↾ cres 5661  Oncon0 6361  ‘cfv 6537  1_oc1o 8451  2_oc2o 8452   No csur 27874   <s clts 27875

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-1o 8458  df-2o 8459  df-no 27877  df-lts 27878

This theorem is used by:  nogesgn1ores  27908