Theorem nnaordex2 8580

Description: Equivalence for ordering. (Contributed by Scott Fenton, 18-Apr-2025.)

Assertion

Ref	Expression
nnaordex2	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ ω (𝐴 +o suc 𝑥) = 𝐵))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem nnaordex2

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nnaordex 8579	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ↔ ∃𝑦 ∈ ω (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵)))
2		nn0suc 7850	. . . . . . 7 ⊢ (𝑦 ∈ ω → (𝑦 = ∅ ∨ ∃𝑥 ∈ ω 𝑦 = suc 𝑥))
3	2	ad2antrl 728	. . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦 ∈ ω ∧ (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵))) → (𝑦 = ∅ ∨ ∃𝑥 ∈ ω 𝑦 = suc 𝑥))
4		simprrl 780	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦 ∈ ω ∧ (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵))) → ∅ ∈ 𝑦)
5		n0i 4299	. . . . . . 7 ⊢ (∅ ∈ 𝑦 → ¬ 𝑦 = ∅)
6	4, 5	syl 17	. . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦 ∈ ω ∧ (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵))) → ¬ 𝑦 = ∅)
7	3, 6	orcnd 878	. . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦 ∈ ω ∧ (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵))) → ∃𝑥 ∈ ω 𝑦 = suc 𝑥)
8		simprrr 781	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦 ∈ ω ∧ (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵))) → (𝐴 +o 𝑦) = 𝐵)
9		oveq2 7377	. . . . . . . 8 ⊢ (𝑦 = suc 𝑥 → (𝐴 +o 𝑦) = (𝐴 +o suc 𝑥))
10	9	eqeq1d 2731	. . . . . . 7 ⊢ (𝑦 = suc 𝑥 → ((𝐴 +o 𝑦) = 𝐵 ↔ (𝐴 +o suc 𝑥) = 𝐵))
11	8, 10	syl5ibcom 245	. . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦 ∈ ω ∧ (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵))) → (𝑦 = suc 𝑥 → (𝐴 +o suc 𝑥) = 𝐵))
12	11	reximdv 3148	. . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦 ∈ ω ∧ (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵))) → (∃𝑥 ∈ ω 𝑦 = suc 𝑥 → ∃𝑥 ∈ ω (𝐴 +o suc 𝑥) = 𝐵))
13	7, 12	mpd 15	. . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑦 ∈ ω ∧ (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵))) → ∃𝑥 ∈ ω (𝐴 +o suc 𝑥) = 𝐵)
14	13	rexlimdvaa 3135	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑦 ∈ ω (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵) → ∃𝑥 ∈ ω (𝐴 +o suc 𝑥) = 𝐵))
15		peano2 7846	. . . . . 6 ⊢ (𝑥 ∈ ω → suc 𝑥 ∈ ω)
16	15	ad2antrl 728	. . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑥 ∈ ω ∧ (𝐴 +o suc 𝑥) = 𝐵)) → suc 𝑥 ∈ ω)
17		nnord 7830	. . . . . . 7 ⊢ (𝑥 ∈ ω → Ord 𝑥)
18	17	ad2antrl 728	. . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑥 ∈ ω ∧ (𝐴 +o suc 𝑥) = 𝐵)) → Ord 𝑥)
19		0elsuc 7790	. . . . . 6 ⊢ (Ord 𝑥 → ∅ ∈ suc 𝑥)
20	18, 19	syl 17	. . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑥 ∈ ω ∧ (𝐴 +o suc 𝑥) = 𝐵)) → ∅ ∈ suc 𝑥)
21		simprr 772	. . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑥 ∈ ω ∧ (𝐴 +o suc 𝑥) = 𝐵)) → (𝐴 +o suc 𝑥) = 𝐵)
22		eleq2 2817	. . . . . . 7 ⊢ (𝑦 = suc 𝑥 → (∅ ∈ 𝑦 ↔ ∅ ∈ suc 𝑥))
23	22, 10	anbi12d 632	. . . . . 6 ⊢ (𝑦 = suc 𝑥 → ((∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵) ↔ (∅ ∈ suc 𝑥 ∧ (𝐴 +o suc 𝑥) = 𝐵)))
24	23	rspcev 3585	. . . . 5 ⊢ ((suc 𝑥 ∈ ω ∧ (∅ ∈ suc 𝑥 ∧ (𝐴 +o suc 𝑥) = 𝐵)) → ∃𝑦 ∈ ω (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵))
25	16, 20, 21, 24	syl12anc 836	. . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝑥 ∈ ω ∧ (𝐴 +o suc 𝑥) = 𝐵)) → ∃𝑦 ∈ ω (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵))
26	25	rexlimdvaa 3135	. . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑥 ∈ ω (𝐴 +o suc 𝑥) = 𝐵 → ∃𝑦 ∈ ω (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵)))
27	14, 26	impbid 212	. 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑦 ∈ ω (∅ ∈ 𝑦 ∧ (𝐴 +o 𝑦) = 𝐵) ↔ ∃𝑥 ∈ ω (𝐴 +o suc 𝑥) = 𝐵))
28	1, 27	bitrd 279	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ ω (𝐴 +o suc 𝑥) = 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1540   ∈ wcel 2109  ∃wrex 3053  ∅c0 4292  Ord word 6319  suc csuc 6322  (class class class)co 7369  ωcom 7822   +_o coa 8408

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5246  ax-nul 5256  ax-pr 5382  ax-un 7691

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4907  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-oadd 8415

This theorem is referenced by:  om2noseqlt  28233