Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  nnaword GIF version

Theorem nnaword 6407
 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.
StepHypRef Expression
1 oveq1 5781 . . . . . . 7 (𝑥 = 𝐶 → (𝑥 +o 𝐴) = (𝐶 +o 𝐴))
2 oveq1 5781 . . . . . . 7 (𝑥 = 𝐶 → (𝑥 +o 𝐵) = (𝐶 +o 𝐵))
31, 2sseq12d 3128 . . . . . 6 (𝑥 = 𝐶 → ((𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵) ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵)))
43bibi2d 231 . . . . 5 (𝑥 = 𝐶 → ((𝐴𝐵 ↔ (𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵)) ↔ (𝐴𝐵 ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵))))
54imbi2d 229 . . . 4 (𝑥 = 𝐶 → (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ (𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵))) ↔ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵)))))
6 oveq1 5781 . . . . . . 7 (𝑥 = ∅ → (𝑥 +o 𝐴) = (∅ +o 𝐴))
7 oveq1 5781 . . . . . . 7 (𝑥 = ∅ → (𝑥 +o 𝐵) = (∅ +o 𝐵))
86, 7sseq12d 3128 . . . . . 6 (𝑥 = ∅ → ((𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵) ↔ (∅ +o 𝐴) ⊆ (∅ +o 𝐵)))
98bibi2d 231 . . . . 5 (𝑥 = ∅ → ((𝐴𝐵 ↔ (𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵)) ↔ (𝐴𝐵 ↔ (∅ +o 𝐴) ⊆ (∅ +o 𝐵))))
10 oveq1 5781 . . . . . . 7 (𝑥 = 𝑦 → (𝑥 +o 𝐴) = (𝑦 +o 𝐴))
11 oveq1 5781 . . . . . . 7 (𝑥 = 𝑦 → (𝑥 +o 𝐵) = (𝑦 +o 𝐵))
1210, 11sseq12d 3128 . . . . . 6 (𝑥 = 𝑦 → ((𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵) ↔ (𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵)))
1312bibi2d 231 . . . . 5 (𝑥 = 𝑦 → ((𝐴𝐵 ↔ (𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵)) ↔ (𝐴𝐵 ↔ (𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵))))
14 oveq1 5781 . . . . . . 7 (𝑥 = suc 𝑦 → (𝑥 +o 𝐴) = (suc 𝑦 +o 𝐴))
15 oveq1 5781 . . . . . . 7 (𝑥 = suc 𝑦 → (𝑥 +o 𝐵) = (suc 𝑦 +o 𝐵))
1614, 15sseq12d 3128 . . . . . 6 (𝑥 = suc 𝑦 → ((𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵) ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵)))
1716bibi2d 231 . . . . 5 (𝑥 = suc 𝑦 → ((𝐴𝐵 ↔ (𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵)) ↔ (𝐴𝐵 ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵))))
18 nna0r 6374 . . . . . . . 8 (𝐴 ∈ ω → (∅ +o 𝐴) = 𝐴)
1918eqcomd 2145 . . . . . . 7 (𝐴 ∈ ω → 𝐴 = (∅ +o 𝐴))
2019adantr 274 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐴 = (∅ +o 𝐴))
21 nna0r 6374 . . . . . . . 8 (𝐵 ∈ ω → (∅ +o 𝐵) = 𝐵)
2221eqcomd 2145 . . . . . . 7 (𝐵 ∈ ω → 𝐵 = (∅ +o 𝐵))
2322adantl 275 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → 𝐵 = (∅ +o 𝐵))
2420, 23sseq12d 3128 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ (∅ +o 𝐴) ⊆ (∅ +o 𝐵)))
25 nnacl 6376 . . . . . . . . . . 11 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω) → (𝑦 +o 𝐴) ∈ ω)
26253adant3 1001 . . . . . . . . . 10 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑦 +o 𝐴) ∈ ω)
27 nnacl 6376 . . . . . . . . . . 11 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → (𝑦 +o 𝐵) ∈ ω)
28273adant2 1000 . . . . . . . . . 10 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑦 +o 𝐵) ∈ ω)
29 nnsucsssuc 6388 . . . . . . . . . 10 (((𝑦 +o 𝐴) ∈ ω ∧ (𝑦 +o 𝐵) ∈ ω) → ((𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵) ↔ suc (𝑦 +o 𝐴) ⊆ suc (𝑦 +o 𝐵)))
3026, 28, 29syl2anc 408 . . . . . . . . 9 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵) ↔ suc (𝑦 +o 𝐴) ⊆ suc (𝑦 +o 𝐵)))
31 nnasuc 6372 . . . . . . . . . . . . 13 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o suc 𝑦) = suc (𝐴 +o 𝑦))
32 peano2 4509 . . . . . . . . . . . . . 14 (𝑦 ∈ ω → suc 𝑦 ∈ ω)
33 nnacom 6380 . . . . . . . . . . . . . 14 ((𝐴 ∈ ω ∧ suc 𝑦 ∈ ω) → (𝐴 +o suc 𝑦) = (suc 𝑦 +o 𝐴))
3432, 33sylan2 284 . . . . . . . . . . . . 13 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o suc 𝑦) = (suc 𝑦 +o 𝐴))
35 nnacom 6380 . . . . . . . . . . . . . 14 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → (𝐴 +o 𝑦) = (𝑦 +o 𝐴))
36 suceq 4324 . . . . . . . . . . . . . 14 ((𝐴 +o 𝑦) = (𝑦 +o 𝐴) → suc (𝐴 +o 𝑦) = suc (𝑦 +o 𝐴))
3735, 36syl 14 . . . . . . . . . . . . 13 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → suc (𝐴 +o 𝑦) = suc (𝑦 +o 𝐴))
3831, 34, 373eqtr3rd 2181 . . . . . . . . . . . 12 ((𝐴 ∈ ω ∧ 𝑦 ∈ ω) → suc (𝑦 +o 𝐴) = (suc 𝑦 +o 𝐴))
3938ancoms 266 . . . . . . . . . . 11 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω) → suc (𝑦 +o 𝐴) = (suc 𝑦 +o 𝐴))
40393adant3 1001 . . . . . . . . . 10 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → suc (𝑦 +o 𝐴) = (suc 𝑦 +o 𝐴))
41 nnasuc 6372 . . . . . . . . . . . . 13 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 +o suc 𝑦) = suc (𝐵 +o 𝑦))
42 nnacom 6380 . . . . . . . . . . . . . 14 ((𝐵 ∈ ω ∧ suc 𝑦 ∈ ω) → (𝐵 +o suc 𝑦) = (suc 𝑦 +o 𝐵))
4332, 42sylan2 284 . . . . . . . . . . . . 13 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 +o suc 𝑦) = (suc 𝑦 +o 𝐵))
44 nnacom 6380 . . . . . . . . . . . . . 14 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → (𝐵 +o 𝑦) = (𝑦 +o 𝐵))
45 suceq 4324 . . . . . . . . . . . . . 14 ((𝐵 +o 𝑦) = (𝑦 +o 𝐵) → suc (𝐵 +o 𝑦) = suc (𝑦 +o 𝐵))
4644, 45syl 14 . . . . . . . . . . . . 13 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → suc (𝐵 +o 𝑦) = suc (𝑦 +o 𝐵))
4741, 43, 463eqtr3rd 2181 . . . . . . . . . . . 12 ((𝐵 ∈ ω ∧ 𝑦 ∈ ω) → suc (𝑦 +o 𝐵) = (suc 𝑦 +o 𝐵))
4847ancoms 266 . . . . . . . . . . 11 ((𝑦 ∈ ω ∧ 𝐵 ∈ ω) → suc (𝑦 +o 𝐵) = (suc 𝑦 +o 𝐵))
49483adant2 1000 . . . . . . . . . 10 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → suc (𝑦 +o 𝐵) = (suc 𝑦 +o 𝐵))
5040, 49sseq12d 3128 . . . . . . . . 9 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc (𝑦 +o 𝐴) ⊆ suc (𝑦 +o 𝐵) ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵)))
5130, 50bitrd 187 . . . . . . . 8 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵) ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵)))
5251bibi2d 231 . . . . . . 7 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴𝐵 ↔ (𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵)) ↔ (𝐴𝐵 ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵))))
5352biimpd 143 . . . . . 6 ((𝑦 ∈ ω ∧ 𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴𝐵 ↔ (𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵)) → (𝐴𝐵 ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵))))
54533expib 1184 . . . . 5 (𝑦 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → ((𝐴𝐵 ↔ (𝑦 +o 𝐴) ⊆ (𝑦 +o 𝐵)) → (𝐴𝐵 ↔ (suc 𝑦 +o 𝐴) ⊆ (suc 𝑦 +o 𝐵)))))
559, 13, 17, 24, 54finds2 4515 . . . 4 (𝑥 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ (𝑥 +o 𝐴) ⊆ (𝑥 +o 𝐵))))
565, 55vtoclga 2752 . . 3 (𝐶 ∈ ω → ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵))))
5756impcom 124 . 2 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐶 ∈ ω) → (𝐴𝐵 ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵)))
58573impa 1176 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐶 ∈ ω) → (𝐴𝐵 ↔ (𝐶 +o 𝐴) ⊆ (𝐶 +o 𝐵)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∧ w3a 962   = wceq 1331   ∈ wcel 1480   ⊆ wss 3071  ∅c0 3363  suc csuc 4287  ωcom 4504  (class class class)co 5774   +o coa 6310 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502 This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-irdg 6267  df-oadd 6317 This theorem is referenced by:  nnacan  6408  nnawordi  6411
 Copyright terms: Public domain W3C validator