Theorem nnaword 6657

Description: Weak ordering property of addition. (Contributed by NM, 17-Sep-1995.) (Revised by Mario Carneiro, 15-Nov-2014.)

Assertion

Ref	Expression
nnaword	⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵)))

Proof of Theorem nnaword

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq1 6008	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝑥 +o 𝐴) = (𝐶 +o 𝐴))
2		oveq1 6008	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝑥 +o 𝐵) = (𝐶 +o 𝐵))
3	1, 2	sseq12d 3255	. . . . . 6 ⊢ (𝑥 = 𝐶 → ((𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵) ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵)))
4	3	bibi2d 232	. . . . 5 ⊢ (𝑥 = 𝐶 → ((𝐴 ⊆ 𝐵 ↔ (𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵)) ↔ (𝐴 ⊆ 𝐵 ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵))))
5	4	imbi2d 230	. . . 4 ⊢ (𝑥 = 𝐶 → (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵))) ↔ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵)))))
6		oveq1 6008	. . . . . . 7 ⊢ (𝑥 = ∅ → (𝑥 +o 𝐴) = (∅ +o 𝐴))
7		oveq1 6008	. . . . . . 7 ⊢ (𝑥 = ∅ → (𝑥 +o 𝐵) = (∅ +o 𝐵))
8	6, 7	sseq12d 3255	. . . . . 6 ⊢ (𝑥 = ∅ → ((𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵) ↔ (∅ +o 𝐴) ⊆ (∅ +o 𝐵)))
9	8	bibi2d 232	. . . . 5 ⊢ (𝑥 = ∅ → ((𝐴 ⊆ 𝐵 ↔ (𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵)) ↔ (𝐴 ⊆ 𝐵 ↔ (∅ +o 𝐴) ⊆ (∅ +o 𝐵))))
10		oveq1 6008	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 +o 𝐴) = (𝑦 +o 𝐴))
11		oveq1 6008	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 +o 𝐵) = (𝑦 +o 𝐵))
12	10, 11	sseq12d 3255	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵) ↔ (𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵)))
13	12	bibi2d 232	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝐴 ⊆ 𝐵 ↔ (𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵)) ↔ (𝐴 ⊆ 𝐵 ↔ (𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵))))
14		oveq1 6008	. . . . . . 7 ⊢ (𝑥 = suc 𝑦 → (𝑥 +o 𝐴) = (suc 𝑦 +o 𝐴))
15		oveq1 6008	. . . . . . 7 ⊢ (𝑥 = suc 𝑦 → (𝑥 +o 𝐵) = (suc 𝑦 +o 𝐵))
16	14, 15	sseq12d 3255	. . . . . 6 ⊢ (𝑥 = suc 𝑦 → ((𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵) ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵)))
17	16	bibi2d 232	. . . . 5 ⊢ (𝑥 = suc 𝑦 → ((𝐴 ⊆ 𝐵 ↔ (𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵)) ↔ (𝐴 ⊆ 𝐵 ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵))))
18		nna0r 6624	. . . . . . . 8 ⊢ (𝐴 ∈ ω → (∅ +o 𝐴) = 𝐴)
19	18	eqcomd 2235	. . . . . . 7 ⊢ (𝐴 ∈ ω → 𝐴 = (∅ +o 𝐴))
20	19	adantr 276	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐴 = (∅ +o 𝐴))
21		nna0r 6624	. . . . . . . 8 ⊢ (𝐵 ∈ ω → (∅ +o 𝐵) = 𝐵)
22	21	eqcomd 2235	. . . . . . 7 ⊢ (𝐵 ∈ ω → 𝐵 = (∅ +o 𝐵))
23	22	adantl 277	. . . . . 6 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐵 = (∅ +o 𝐵))
24	20, 23	sseq12d 3255	. . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (∅ +o 𝐴) ⊆ (∅ +o 𝐵)))
25		nnacl 6626	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ω ∧ 𝐴 ∈ ω) → (𝑦 +o 𝐴) ∈ ω)
26	25	3adant3 1041	. . . . . . . . . 10 ⊢ ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑦 +o 𝐴) ∈ ω)
27		nnacl 6626	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → (𝑦 +o 𝐵) ∈ ω)
28	27	3adant2 1040	. . . . . . . . . 10 ⊢ ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑦 +o 𝐵) ∈ ω)
29		nnsucsssuc 6638	. . . . . . . . . 10 ⊢ (((𝑦 +o 𝐴) ∈ ω ∧ (𝑦 +o 𝐵) ∈ ω) → ((𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵) ↔ suc (𝑦 +o 𝐴) ⊆ suc (𝑦 +o 𝐵)))
30	26, 28, 29	syl2anc 411	. . . . . . . . 9 ⊢ ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵) ↔ suc (𝑦 +o 𝐴) ⊆ suc (𝑦 +o 𝐵)))
31		nnasuc 6622	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o suc 𝑦) = suc (𝐴 +o 𝑦))
32		peano2 4687	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ω → suc 𝑦 ∈ ω)
33		nnacom 6630	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ω ∧ suc 𝑦 ∈ ω) → (𝐴 +o suc 𝑦) = (suc 𝑦 +o 𝐴))
34	32, 33	sylan2 286	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o suc 𝑦) = (suc 𝑦 +o 𝐴))
35		nnacom 6630	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o 𝑦) = (𝑦 +o 𝐴))
36		suceq 4493	. . . . . . . . . . . . . 14 ⊢ ((𝐴 +o 𝑦) = (𝑦 +o 𝐴) → suc (𝐴 +o 𝑦) = suc (𝑦 +o 𝐴))
37	35, 36	syl 14	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → suc (𝐴 +o 𝑦) = suc (𝑦 +o 𝐴))
38	31, 34, 37	3eqtr3rd 2271	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → suc (𝑦 +o 𝐴) = (suc 𝑦 +o 𝐴))
39	38	ancoms 268	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ω ∧ 𝐴 ∈ ω) → suc (𝑦 +o 𝐴) = (suc 𝑦 +o 𝐴))
40	39	3adant3 1041	. . . . . . . . . 10 ⊢ ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → suc (𝑦 +o 𝐴) = (suc 𝑦 +o 𝐴))
41		nnasuc 6622	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 +o suc 𝑦) = suc (𝐵 +o 𝑦))
42		nnacom 6630	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ ω ∧ suc 𝑦 ∈ ω) → (𝐵 +o suc 𝑦) = (suc 𝑦 +o 𝐵))
43	32, 42	sylan2 286	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 +o suc 𝑦) = (suc 𝑦 +o 𝐵))
44		nnacom 6630	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 +o 𝑦) = (𝑦 +o 𝐵))
45		suceq 4493	. . . . . . . . . . . . . 14 ⊢ ((𝐵 +o 𝑦) = (𝑦 +o 𝐵) → suc (𝐵 +o 𝑦) = suc (𝑦 +o 𝐵))
46	44, 45	syl 14	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → suc (𝐵 +o 𝑦) = suc (𝑦 +o 𝐵))
47	41, 43, 46	3eqtr3rd 2271	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → suc (𝑦 +o 𝐵) = (suc 𝑦 +o 𝐵))
48	47	ancoms 268	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → suc (𝑦 +o 𝐵) = (suc 𝑦 +o 𝐵))
49	48	3adant2 1040	. . . . . . . . . 10 ⊢ ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → suc (𝑦 +o 𝐵) = (suc 𝑦 +o 𝐵))
50	40, 49	sseq12d 3255	. . . . . . . . 9 ⊢ ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc (𝑦 +o 𝐴) ⊆ suc (𝑦 +o 𝐵) ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵)))
51	30, 50	bitrd 188	. . . . . . . 8 ⊢ ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵) ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵)))
52	51	bibi2d 232	. . . . . . 7 ⊢ ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ⊆ 𝐵 ↔ (𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵)) ↔ (𝐴 ⊆ 𝐵 ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵))))
53	52	biimpd 144	. . . . . 6 ⊢ ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ⊆ 𝐵 ↔ (𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵)) → (𝐴 ⊆ 𝐵 ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵))))
54	53	3expib 1230	. . . . 5 ⊢ (𝑦 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴 ⊆ 𝐵 ↔ (𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵)) → (𝐴 ⊆ 𝐵 ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵)))))
55	9, 13, 17, 24, 54	finds2 4693	. . . 4 ⊢ (𝑥 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵))))
56	5, 55	vtoclga 2867	. . 3 ⊢ (𝐶 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵))))
57	56	impcom 125	. 2 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐶 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵)))
58	57	3impa 1218	1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1002   = wceq 1395   ∈ wcel 2200   ⊆ wss 3197  ∅c0 3491  suc csuc 4456  ωcom 4682  (class class class)co 6001   +_o coa 6559

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-recs 6451  df-irdg 6516  df-oadd 6566

This theorem is referenced by:  nnacan  6658  nnawordi  6661