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

Theorem nnawordex 6675
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 6639 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))
213adant3 1041 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴𝐵𝐴 = 𝐵𝐵𝐴))
3 nnaordex 6674 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵)))
4 simpr 110 . . . . . . . 8 ((∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵) → (𝐴 +o 𝑥) = 𝐵)
54reximi 2627 . . . . . . 7 (∃𝑥 ∈ ω (∅ ∈ 𝑥 ∧ (𝐴 +o 𝑥) = 𝐵) → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵)
63, 5biimtrdi 163 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
763adant3 1041 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
8 nna0 6620 . . . . . . . 8 (𝐴 ∈ ω → (𝐴 +o ∅) = 𝐴)
983ad2ant1 1042 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴 +o ∅) = 𝐴)
10 eqeq2 2239 . . . . . . 7 (𝐴 = 𝐵 → ((𝐴 +o ∅) = 𝐴 ↔ (𝐴 +o ∅) = 𝐵))
119, 10syl5ibcom 155 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴 = 𝐵 → (𝐴 +o ∅) = 𝐵))
12 peano1 4686 . . . . . . 7 ∅ ∈ ω
13 oveq2 6009 . . . . . . . . 9 (𝑥 = ∅ → (𝐴 +o 𝑥) = (𝐴 +o ∅))
1413eqeq1d 2238 . . . . . . . 8 (𝑥 = ∅ → ((𝐴 +o 𝑥) = 𝐵 ↔ (𝐴 +o ∅) = 𝐵))
1514rspcev 2907 . . . . . . 7 ((∅ ∈ ω ∧ (𝐴 +o ∅) = 𝐵) → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵)
1612, 15mpan 424 . . . . . 6 ((𝐴 +o ∅) = 𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵)
1711, 16syl6 33 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐴 = 𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
18 nntri1 6642 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ¬ 𝐵𝐴))
1918biimp3a 1379 . . . . . 6 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → ¬ 𝐵𝐴)
2019pm2.21d 622 . . . . 5 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → (𝐵𝐴 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
217, 17, 203jaod 1338 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → ((𝐴𝐵𝐴 = 𝐵𝐵𝐴) → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
222, 21mpd 13 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω ∧ 𝐴𝐵) → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵)
23223expia 1229 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 → ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
24 nnaword1 6659 . . . . 5 ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → 𝐴 ⊆ (𝐴 +o 𝑥))
25 sseq2 3248 . . . . 5 ((𝐴 +o 𝑥) = 𝐵 → (𝐴 ⊆ (𝐴 +o 𝑥) ↔ 𝐴𝐵))
2624, 25syl5ibcom 155 . . . 4 ((𝐴 ∈ ω ∧ 𝑥 ∈ ω) → ((𝐴 +o 𝑥) = 𝐵𝐴𝐵))
2726rexlimdva 2648 . . 3 (𝐴 ∈ ω → (∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵𝐴𝐵))
2827adantr 276 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵𝐴𝐵))
2923, 28impbid 129 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵 ↔ ∃𝑥 ∈ ω (𝐴 +o 𝑥) = 𝐵))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  w3o 1001  w3a 1002   = wceq 1395  wcel 2200  wrex 2509  wss 3197  c0 3491  ω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-3or 1003  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-1o 6562  df-oadd 6566
This theorem is referenced by:  prarloclemn  7686
  Copyright terms: Public domain W3C validator