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

Theorem nnawordex 6802
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 6766 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))
213adant3 1048 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))
3 nnaordex 6801 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵)))
4 simpr 110 . . . . . . . 8 ((∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵) → (𝐴 +o 𝑥) = 𝐵)
54reximi 2647 . . . . . . 7 (∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵) → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵)
63, 5biimtrdi 163 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
763adant3 1048 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
8 nna0 6747 . . . . . . . 8 (𝐴 ∈ ω → (𝐴 +o ∅) = 𝐴)
983ad2ant1 1049 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴 +o ∅) = 𝐴)
10 eqeq2 2248 . . . . . . 7 (𝐴 = 𝐵 → ((𝐴 +o ∅) = 𝐴 ↔ (𝐴 +o ∅) = 𝐵))
119, 10syl5ibcom 155 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴 = 𝐵 → (𝐴 +o ∅) = 𝐵))
12 peano1 4741 . . . . . . 7 ∅ ∈ ω
13 oveq2 6093 . . . . . . . . 9 (𝑥 = ∅ → (𝐴 +o 𝑥) = (𝐴 +o ∅))
1413eqeq1d 2247 . . . . . . . 8 (𝑥 = ∅ → ((𝐴 +o 𝑥) = 𝐵 ↔ (𝐴 +o ∅) = 𝐵))
1514rspcev 2929 . . . . . . 7 ((∅ ∈ ω ∧ (𝐴 +o ∅) = 𝐵) → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵)
1612, 15mpan 428 . . . . . 6 ((𝐴 +o ∅) = 𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵)
1711, 16syl6 33 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴 = 𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
18 nntri1 6769 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ¬ 𝐵𝐴))
1918biimp3a 1386 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → ¬ 𝐵𝐴)
2019pm2.21d 628 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐵𝐴 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
217, 17, 203jaod 1345 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → ((𝐴𝐵𝐴 = 𝐵𝐵𝐴) → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
222, 21mpd 13 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵)
23223expia 1236 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
24 nnaword1 6786 . . . . 5 ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → 𝐴 ⊆ (𝐴 +o 𝑥))
25 sseq2 3272 . . . . 5 ((𝐴 +o 𝑥) = 𝐵 → (𝐴 ⊆ (𝐴 +o 𝑥) ↔ 𝐴𝐵))
2624, 25syl5ibcom 155 . . . 4 ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → ((𝐴 +o 𝑥) = 𝐵𝐴𝐵))
2726rexlimdva 2668 . . 3 (𝐴 ∈ ω → (∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵𝐴𝐵))
2827adantr 276 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵𝐴𝐵))
2923, 28impbid 129 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 104  wb 105  w3o 1008  w3a 1009   = wceq 1402  wcel 2209  wrex 2529  wss 3220  c0 3520  ωcom 4737  (class class class)co 6085   +o coa 6684
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-oadd 6691
This theorem is used by:  prarloclemn  7866
  Copyright terms: Public domain W3C validator