Theorem eldifsucnn 33597

Description: Condition for membership in the difference of ω and a nonzero finite ordinal. (Contributed by Scott Fenton, 24-Oct-2024.)

Assertion

Ref	Expression
eldifsucnn	⊢ (𝐴 ∈ ω → (𝐵 ∈ (ω ∖ suc 𝐴) ↔ ∃𝑥 ∈ (ω ∖ 𝐴)𝐵 = suc 𝑥))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem eldifsucnn

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		peano2 7711	. . . . . 6 ⊢ (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2		nnawordex 8430	. . . . . 6 ⊢ ((suc 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ⊆ 𝐵 ↔ ∃𝑦 ∈ ω (suc 𝐴 +o 𝑦) = 𝐵))
3	1, 2	sylan 579	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ⊆ 𝐵 ↔ ∃𝑦 ∈ ω (suc 𝐴 +o 𝑦) = 𝐵))
4		nnacl 8404	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o 𝑦) ∈ ω)
5		nnaword1 8422	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → 𝐴 ⊆ (𝐴 +o 𝑦))
6		nnasuc 8399	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ω ∧ 𝐴 ∈ ω) → (𝑦 +o suc 𝐴) = suc (𝑦 +o 𝐴))
7	6	ancoms 458	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝑦 +o suc 𝐴) = suc (𝑦 +o 𝐴))
8		nnacom 8410	. . . . . . . . . . 11 ⊢ ((suc 𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (suc 𝐴 +o 𝑦) = (𝑦 +o suc 𝐴))
9	1, 8	sylan 579	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (suc 𝐴 +o 𝑦) = (𝑦 +o suc 𝐴))
10		nnacom 8410	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o 𝑦) = (𝑦 +o 𝐴))
11		suceq 6316	. . . . . . . . . . 11 ⊢ ((𝐴 +o 𝑦) = (𝑦 +o 𝐴) → suc (𝐴 +o 𝑦) = suc (𝑦 +o 𝐴))
12	10, 11	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → suc (𝐴 +o 𝑦) = suc (𝑦 +o 𝐴))
13	7, 9, 12	3eqtr4d 2788	. . . . . . . . 9 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (suc 𝐴 +o 𝑦) = suc (𝐴 +o 𝑦))
14		sseq2 3943	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐴 +o 𝑦) → (𝐴 ⊆ 𝑥 ↔ 𝐴 ⊆ (𝐴 +o 𝑦)))
15		suceq 6316	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐴 +o 𝑦) → suc 𝑥 = suc (𝐴 +o 𝑦))
16	15	eqeq2d 2749	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐴 +o 𝑦) → ((suc 𝐴 +o 𝑦) = suc 𝑥 ↔ (suc 𝐴 +o 𝑦) = suc (𝐴 +o 𝑦)))
17	14, 16	anbi12d 630	. . . . . . . . . 10 ⊢ (𝑥 = (𝐴 +o 𝑦) → ((𝐴 ⊆ 𝑥 ∧ (suc 𝐴 +o 𝑦) = suc 𝑥) ↔ (𝐴 ⊆ (𝐴 +o 𝑦) ∧ (suc 𝐴 +o 𝑦) = suc (𝐴 +o 𝑦))))
18	17	rspcev 3552	. . . . . . . . 9 ⊢ (((𝐴 +o 𝑦) ∈ ω ∧ (𝐴 ⊆ (𝐴 +o 𝑦) ∧ (suc 𝐴 +o 𝑦) = suc (𝐴 +o 𝑦))) → ∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ (suc 𝐴 +o 𝑦) = suc 𝑥))
19	4, 5, 13, 18	syl12anc 833	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ (suc 𝐴 +o 𝑦) = suc 𝑥))
20		eqeq1 2742	. . . . . . . . . 10 ⊢ ((suc 𝐴 +o 𝑦) = 𝐵 → ((suc 𝐴 +o 𝑦) = suc 𝑥 ↔ 𝐵 = suc 𝑥))
21	20	anbi2d 628	. . . . . . . . 9 ⊢ ((suc 𝐴 +o 𝑦) = 𝐵 → ((𝐴 ⊆ 𝑥 ∧ (suc 𝐴 +o 𝑦) = suc 𝑥) ↔ (𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥)))
22	21	rexbidv 3225	. . . . . . . 8 ⊢ ((suc 𝐴 +o 𝑦) = 𝐵 → (∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ (suc 𝐴 +o 𝑦) = suc 𝑥) ↔ ∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥)))
23	19, 22	syl5ibcom 244	. . . . . . 7 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → ((suc 𝐴 +o 𝑦) = 𝐵 → ∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥)))
24	23	rexlimdva 3212	. . . . . 6 ⊢ (𝐴 ∈ ω → (∃𝑦 ∈ ω (suc 𝐴 +o 𝑦) = 𝐵 → ∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥)))
25	24	adantr 480	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑦 ∈ ω (suc 𝐴 +o 𝑦) = 𝐵 → ∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥)))
26	3, 25	sylbid 239	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ⊆ 𝐵 → ∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥)))
27	26	expimpd 453	. . 3 ⊢ (𝐴 ∈ ω → ((𝐵 ∈ ω ∧ suc 𝐴 ⊆ 𝐵) → ∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥)))
28		peano2 7711	. . . . . . . 8 ⊢ (𝑥 ∈ ω → suc 𝑥 ∈ ω)
29	28	ad2antlr 723	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝑥 ∈ ω) ∧ 𝐴 ⊆ 𝑥) → suc 𝑥 ∈ ω)
30		nnord 7695	. . . . . . . . 9 ⊢ (𝐴 ∈ ω → Ord 𝐴)
31		nnord 7695	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → Ord 𝑥)
32		ordsucsssuc 7645	. . . . . . . . 9 ⊢ ((Ord 𝐴 ∧ Ord 𝑥) → (𝐴 ⊆ 𝑥 ↔ suc 𝐴 ⊆ suc 𝑥))
33	30, 31, 32	syl2an 595	. . . . . . . 8 ⊢ ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → (𝐴 ⊆ 𝑥 ↔ suc 𝐴 ⊆ suc 𝑥))
34	33	biimpa 476	. . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝑥 ∈ ω) ∧ 𝐴 ⊆ 𝑥) → suc 𝐴 ⊆ suc 𝑥)
35	29, 34	jca 511	. . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝑥 ∈ ω) ∧ 𝐴 ⊆ 𝑥) → (suc 𝑥 ∈ ω ∧ suc 𝐴 ⊆ suc 𝑥))
36		eleq1 2826	. . . . . . 7 ⊢ (𝐵 = suc 𝑥 → (𝐵 ∈ ω ↔ suc 𝑥 ∈ ω))
37		sseq2 3943	. . . . . . 7 ⊢ (𝐵 = suc 𝑥 → (suc 𝐴 ⊆ 𝐵 ↔ suc 𝐴 ⊆ suc 𝑥))
38	36, 37	anbi12d 630	. . . . . 6 ⊢ (𝐵 = suc 𝑥 → ((𝐵 ∈ ω ∧ suc 𝐴 ⊆ 𝐵) ↔ (suc 𝑥 ∈ ω ∧ suc 𝐴 ⊆ suc 𝑥)))
39	35, 38	syl5ibrcom 246	. . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝑥 ∈ ω) ∧ 𝐴 ⊆ 𝑥) → (𝐵 = suc 𝑥 → (𝐵 ∈ ω ∧ suc 𝐴 ⊆ 𝐵)))
40	39	expimpd 453	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → ((𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥) → (𝐵 ∈ ω ∧ suc 𝐴 ⊆ 𝐵)))
41	40	rexlimdva 3212	. . 3 ⊢ (𝐴 ∈ ω → (∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥) → (𝐵 ∈ ω ∧ suc 𝐴 ⊆ 𝐵)))
42	27, 41	impbid 211	. 2 ⊢ (𝐴 ∈ ω → ((𝐵 ∈ ω ∧ suc 𝐴 ⊆ 𝐵) ↔ ∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥)))
43		eldif 3893	. . 3 ⊢ (𝐵 ∈ (ω ∖ suc 𝐴) ↔ (𝐵 ∈ ω ∧ ¬ 𝐵 ∈ suc 𝐴))
44		nnord 7695	. . . . . 6 ⊢ (suc 𝐴 ∈ ω → Ord suc 𝐴)
45	1, 44	syl 17	. . . . 5 ⊢ (𝐴 ∈ ω → Ord suc 𝐴)
46		nnord 7695	. . . . 5 ⊢ (𝐵 ∈ ω → Ord 𝐵)
47		ordtri1 6284	. . . . 5 ⊢ ((Ord suc 𝐴 ∧ Ord 𝐵) → (suc 𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ suc 𝐴))
48	45, 46, 47	syl2an 595	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ suc 𝐴))
49	48	pm5.32da 578	. . 3 ⊢ (𝐴 ∈ ω → ((𝐵 ∈ ω ∧ suc 𝐴 ⊆ 𝐵) ↔ (𝐵 ∈ ω ∧ ¬ 𝐵 ∈ suc 𝐴)))
50	43, 49	bitr4id 289	. 2 ⊢ (𝐴 ∈ ω → (𝐵 ∈ (ω ∖ suc 𝐴) ↔ (𝐵 ∈ ω ∧ suc 𝐴 ⊆ 𝐵)))
51		eldif 3893	. . . . . 6 ⊢ (𝑥 ∈ (ω ∖ 𝐴) ↔ (𝑥 ∈ ω ∧ ¬ 𝑥 ∈ 𝐴))
52	51	anbi1i 623	. . . . 5 ⊢ ((𝑥 ∈ (ω ∖ 𝐴) ∧ 𝐵 = suc 𝑥) ↔ ((𝑥 ∈ ω ∧ ¬ 𝑥 ∈ 𝐴) ∧ 𝐵 = suc 𝑥))
53		anass 468	. . . . 5 ⊢ (((𝑥 ∈ ω ∧ ¬ 𝑥 ∈ 𝐴) ∧ 𝐵 = suc 𝑥) ↔ (𝑥 ∈ ω ∧ (¬ 𝑥 ∈ 𝐴 ∧ 𝐵 = suc 𝑥)))
54	52, 53	bitri 274	. . . 4 ⊢ ((𝑥 ∈ (ω ∖ 𝐴) ∧ 𝐵 = suc 𝑥) ↔ (𝑥 ∈ ω ∧ (¬ 𝑥 ∈ 𝐴 ∧ 𝐵 = suc 𝑥)))
55	54	rexbii2 3175	. . 3 ⊢ (∃𝑥 ∈ (ω ∖ 𝐴)𝐵 = suc 𝑥 ↔ ∃𝑥 ∈ ω (¬ 𝑥 ∈ 𝐴 ∧ 𝐵 = suc 𝑥))
56		ordtri1 6284	. . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝑥) → (𝐴 ⊆ 𝑥 ↔ ¬ 𝑥 ∈ 𝐴))
57	30, 31, 56	syl2an 595	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → (𝐴 ⊆ 𝑥 ↔ ¬ 𝑥 ∈ 𝐴))
58	57	anbi1d 629	. . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → ((𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥) ↔ (¬ 𝑥 ∈ 𝐴 ∧ 𝐵 = suc 𝑥)))
59	58	rexbidva 3224	. . 3 ⊢ (𝐴 ∈ ω → (∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥) ↔ ∃𝑥 ∈ ω (¬ 𝑥 ∈ 𝐴 ∧ 𝐵 = suc 𝑥)))
60	55, 59	bitr4id 289	. 2 ⊢ (𝐴 ∈ ω → (∃𝑥 ∈ (ω ∖ 𝐴)𝐵 = suc 𝑥 ↔ ∃𝑥 ∈ ω (𝐴 ⊆ 𝑥 ∧ 𝐵 = suc 𝑥)))
61	42, 50, 60	3bitr4d 310	1 ⊢ (𝐴 ∈ ω → (𝐵 ∈ (ω ∖ suc 𝐴) ↔ ∃𝑥 ∈ (ω ∖ 𝐴)𝐵 = suc 𝑥))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ∃wrex 3064   ∖ cdif 3880   ⊆ wss 3883  Ord word 6250  suc csuc 6253  (class class class)co 7255  ωcom 7687   +_o coa 8264

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-oadd 8271

This theorem is referenced by:  brttrcl2  33700  ttrcltr  33702  rnttrcl  33708