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

Theorem nnawordex 6432
Description: Equivalence for weak ordering of natural numbers. (Contributed by NM, 8-Nov-2002.) (Revised by Mario Carneiro, 15-Nov-2014.)
Assertion
Ref Expression
nnawordex ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem nnawordex
StepHypRef Expression
1 nntri3or 6397 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))
213adant3 1002 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))
3 nnaordex 6431 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵)))
4 simpr 109 . . . . . . . 8 ((∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵) → (𝐴 +o 𝑥) = 𝐵)
54reximi 2532 . . . . . . 7 (∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵) → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵)
63, 5syl6bi 162 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
763adant3 1002 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
8 nna0 6378 . . . . . . . 8 (𝐴 ∈ ω → (𝐴 +o ∅) = 𝐴)
983ad2ant1 1003 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴 +o ∅) = 𝐴)
10 eqeq2 2150 . . . . . . 7 (𝐴 = 𝐵 → ((𝐴 +o ∅) = 𝐴 ↔ (𝐴 +o ∅) = 𝐵))
119, 10syl5ibcom 154 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴 = 𝐵 → (𝐴 +o ∅) = 𝐵))
12 peano1 4516 . . . . . . 7 ∅ ∈ ω
13 oveq2 5790 . . . . . . . . 9 (𝑥 = ∅ → (𝐴 +o 𝑥) = (𝐴 +o ∅))
1413eqeq1d 2149 . . . . . . . 8 (𝑥 = ∅ → ((𝐴 +o 𝑥) = 𝐵 ↔ (𝐴 +o ∅) = 𝐵))
1514rspcev 2793 . . . . . . 7 ((∅ ∈ ω ∧ (𝐴 +o ∅) = 𝐵) → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵)
1612, 15mpan 421 . . . . . 6 ((𝐴 +o ∅) = 𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵)
1711, 16syl6 33 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴 = 𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
18 nntri1 6400 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ¬ 𝐵𝐴))
1918biimp3a 1324 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → ¬ 𝐵𝐴)
2019pm2.21d 609 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐵𝐴 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
217, 17, 203jaod 1283 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → ((𝐴𝐵𝐴 = 𝐵𝐵𝐴) → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
222, 21mpd 13 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵)
23223expia 1184 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
24 nnaword1 6417 . . . . 5 ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → 𝐴 ⊆ (𝐴 +o 𝑥))
25 sseq2 3126 . . . . 5 ((𝐴 +o 𝑥) = 𝐵 → (𝐴 ⊆ (𝐴 +o 𝑥) ↔ 𝐴𝐵))
2624, 25syl5ibcom 154 . . . 4 ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → ((𝐴 +o 𝑥) = 𝐵𝐴𝐵))
2726rexlimdva 2552 . . 3 (𝐴 ∈ ω → (∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵𝐴𝐵))
2827adantr 274 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵𝐴𝐵))
2923, 28impbid 128 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104  w3o 962  w3a 963   = wceq 1332  wcel 1481  wrex 2418  wss 3076  c0 3368  ωcom 4512  (class class class)co 5782   +o coa 6318
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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-iinf 4510
This theorem depends on definitions:  df-bi 116  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-id 4223  df-iord 4296  df-on 4298  df-suc 4301  df-iom 4513  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-ov 5785  df-oprab 5786  df-mpo 5787  df-1st 6046  df-2nd 6047  df-recs 6210  df-irdg 6275  df-1o 6321  df-oadd 6325
This theorem is referenced by:  prarloclemn  7331
  Copyright terms: Public domain W3C validator