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

Theorem nneneq 7042
Description: Two equinumerous natural numbers are equal. Proposition 10.20 of [TakeutiZaring] p. 90 and its converse. Also compare Corollary 6E of [Enderton] p. 136. (Contributed by NM, 28-May-1998.)
Assertion
Ref Expression
nneneq ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵𝐴 = 𝐵))

Proof of Theorem nneneq
Dummy variables 𝑥 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq1 4091 . . . . . 6 (𝑥 = ∅ → (𝑥𝑧 ↔ ∅ ≈ 𝑧))
2 eqeq1 2238 . . . . . 6 (𝑥 = ∅ → (𝑥 = 𝑧 ↔ ∅ = 𝑧))
31, 2imbi12d 234 . . . . 5 (𝑥 = ∅ → ((𝑥𝑧𝑥 = 𝑧) ↔ (∅ ≈ 𝑧 → ∅ = 𝑧)))
43ralbidv 2532 . . . 4 (𝑥 = ∅ → (∀𝑧 ∈ ω (𝑥𝑧𝑥 = 𝑧) ↔ ∀𝑧 ∈ ω (∅ ≈ 𝑧 → ∅ = 𝑧)))
5 breq1 4091 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑧𝑦𝑧))
6 eqeq1 2238 . . . . . 6 (𝑥 = 𝑦 → (𝑥 = 𝑧𝑦 = 𝑧))
75, 6imbi12d 234 . . . . 5 (𝑥 = 𝑦 → ((𝑥𝑧𝑥 = 𝑧) ↔ (𝑦𝑧𝑦 = 𝑧)))
87ralbidv 2532 . . . 4 (𝑥 = 𝑦 → (∀𝑧 ∈ ω (𝑥𝑧𝑥 = 𝑧) ↔ ∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧)))
9 breq1 4091 . . . . . 6 (𝑥 = suc 𝑦 → (𝑥𝑧 ↔ suc 𝑦𝑧))
10 eqeq1 2238 . . . . . 6 (𝑥 = suc 𝑦 → (𝑥 = 𝑧 ↔ suc 𝑦 = 𝑧))
119, 10imbi12d 234 . . . . 5 (𝑥 = suc 𝑦 → ((𝑥𝑧𝑥 = 𝑧) ↔ (suc 𝑦𝑧 → suc 𝑦 = 𝑧)))
1211ralbidv 2532 . . . 4 (𝑥 = suc 𝑦 → (∀𝑧 ∈ ω (𝑥𝑧𝑥 = 𝑧) ↔ ∀𝑧 ∈ ω (suc 𝑦𝑧 → suc 𝑦 = 𝑧)))
13 breq1 4091 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑧𝐴𝑧))
14 eqeq1 2238 . . . . . 6 (𝑥 = 𝐴 → (𝑥 = 𝑧𝐴 = 𝑧))
1513, 14imbi12d 234 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝑧𝑥 = 𝑧) ↔ (𝐴𝑧𝐴 = 𝑧)))
1615ralbidv 2532 . . . 4 (𝑥 = 𝐴 → (∀𝑧 ∈ ω (𝑥𝑧𝑥 = 𝑧) ↔ ∀𝑧 ∈ ω (𝐴𝑧𝐴 = 𝑧)))
17 ensym 6954 . . . . . 6 (∅ ≈ 𝑧𝑧 ≈ ∅)
18 en0 6968 . . . . . . 7 (𝑧 ≈ ∅ ↔ 𝑧 = ∅)
19 eqcom 2233 . . . . . . 7 (𝑧 = ∅ ↔ ∅ = 𝑧)
2018, 19bitri 184 . . . . . 6 (𝑧 ≈ ∅ ↔ ∅ = 𝑧)
2117, 20sylib 122 . . . . 5 (∅ ≈ 𝑧 → ∅ = 𝑧)
2221rgenw 2587 . . . 4 𝑧 ∈ ω (∅ ≈ 𝑧 → ∅ = 𝑧)
23 nn0suc 4702 . . . . . . 7 (𝑤 ∈ ω → (𝑤 = ∅ ∨ ∃𝑧 ∈ ω 𝑤 = suc 𝑧))
24 en0 6968 . . . . . . . . . . . 12 (suc 𝑦 ≈ ∅ ↔ suc 𝑦 = ∅)
25 breq2 4092 . . . . . . . . . . . . 13 (𝑤 = ∅ → (suc 𝑦𝑤 ↔ suc 𝑦 ≈ ∅))
26 eqeq2 2241 . . . . . . . . . . . . 13 (𝑤 = ∅ → (suc 𝑦 = 𝑤 ↔ suc 𝑦 = ∅))
2725, 26bibi12d 235 . . . . . . . . . . . 12 (𝑤 = ∅ → ((suc 𝑦𝑤 ↔ suc 𝑦 = 𝑤) ↔ (suc 𝑦 ≈ ∅ ↔ suc 𝑦 = ∅)))
2824, 27mpbiri 168 . . . . . . . . . . 11 (𝑤 = ∅ → (suc 𝑦𝑤 ↔ suc 𝑦 = 𝑤))
2928biimpd 144 . . . . . . . . . 10 (𝑤 = ∅ → (suc 𝑦𝑤 → suc 𝑦 = 𝑤))
3029a1i 9 . . . . . . . . 9 ((𝑦 ∈ ω ∧ ∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧)) → (𝑤 = ∅ → (suc 𝑦𝑤 → suc 𝑦 = 𝑤)))
31 nfv 1576 . . . . . . . . . . 11 𝑧 𝑦 ∈ ω
32 nfra1 2563 . . . . . . . . . . 11 𝑧𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧)
3331, 32nfan 1613 . . . . . . . . . 10 𝑧(𝑦 ∈ ω ∧ ∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧))
34 nfv 1576 . . . . . . . . . 10 𝑧(suc 𝑦𝑤 → suc 𝑦 = 𝑤)
35 rsp 2579 . . . . . . . . . . . . . 14 (∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧) → (𝑧 ∈ ω → (𝑦𝑧𝑦 = 𝑧)))
36 vex 2805 . . . . . . . . . . . . . . . . . 18 𝑦 ∈ V
37 vex 2805 . . . . . . . . . . . . . . . . . 18 𝑧 ∈ V
3836, 37phplem4 7040 . . . . . . . . . . . . . . . . 17 ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → (suc 𝑦 ≈ suc 𝑧𝑦𝑧))
3938imim1d 75 . . . . . . . . . . . . . . . 16 ((𝑦 ∈ ω ∧ 𝑧 ∈ ω) → ((𝑦𝑧𝑦 = 𝑧) → (suc 𝑦 ≈ suc 𝑧𝑦 = 𝑧)))
4039ex 115 . . . . . . . . . . . . . . 15 (𝑦 ∈ ω → (𝑧 ∈ ω → ((𝑦𝑧𝑦 = 𝑧) → (suc 𝑦 ≈ suc 𝑧𝑦 = 𝑧))))
4140a2d 26 . . . . . . . . . . . . . 14 (𝑦 ∈ ω → ((𝑧 ∈ ω → (𝑦𝑧𝑦 = 𝑧)) → (𝑧 ∈ ω → (suc 𝑦 ≈ suc 𝑧𝑦 = 𝑧))))
4235, 41syl5 32 . . . . . . . . . . . . 13 (𝑦 ∈ ω → (∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧) → (𝑧 ∈ ω → (suc 𝑦 ≈ suc 𝑧𝑦 = 𝑧))))
4342imp 124 . . . . . . . . . . . 12 ((𝑦 ∈ ω ∧ ∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧)) → (𝑧 ∈ ω → (suc 𝑦 ≈ suc 𝑧𝑦 = 𝑧)))
44 suceq 4499 . . . . . . . . . . . 12 (𝑦 = 𝑧 → suc 𝑦 = suc 𝑧)
4543, 44syl8 71 . . . . . . . . . . 11 ((𝑦 ∈ ω ∧ ∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧)) → (𝑧 ∈ ω → (suc 𝑦 ≈ suc 𝑧 → suc 𝑦 = suc 𝑧)))
46 breq2 4092 . . . . . . . . . . . . 13 (𝑤 = suc 𝑧 → (suc 𝑦𝑤 ↔ suc 𝑦 ≈ suc 𝑧))
47 eqeq2 2241 . . . . . . . . . . . . 13 (𝑤 = suc 𝑧 → (suc 𝑦 = 𝑤 ↔ suc 𝑦 = suc 𝑧))
4846, 47imbi12d 234 . . . . . . . . . . . 12 (𝑤 = suc 𝑧 → ((suc 𝑦𝑤 → suc 𝑦 = 𝑤) ↔ (suc 𝑦 ≈ suc 𝑧 → suc 𝑦 = suc 𝑧)))
4948biimprcd 160 . . . . . . . . . . 11 ((suc 𝑦 ≈ suc 𝑧 → suc 𝑦 = suc 𝑧) → (𝑤 = suc 𝑧 → (suc 𝑦𝑤 → suc 𝑦 = 𝑤)))
5045, 49syl6 33 . . . . . . . . . 10 ((𝑦 ∈ ω ∧ ∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧)) → (𝑧 ∈ ω → (𝑤 = suc 𝑧 → (suc 𝑦𝑤 → suc 𝑦 = 𝑤))))
5133, 34, 50rexlimd 2647 . . . . . . . . 9 ((𝑦 ∈ ω ∧ ∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧)) → (∃𝑧 ∈ ω 𝑤 = suc 𝑧 → (suc 𝑦𝑤 → suc 𝑦 = 𝑤)))
5230, 51jaod 724 . . . . . . . 8 ((𝑦 ∈ ω ∧ ∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧)) → ((𝑤 = ∅ ∨ ∃𝑧 ∈ ω 𝑤 = suc 𝑧) → (suc 𝑦𝑤 → suc 𝑦 = 𝑤)))
5352ex 115 . . . . . . 7 (𝑦 ∈ ω → (∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧) → ((𝑤 = ∅ ∨ ∃𝑧 ∈ ω 𝑤 = suc 𝑧) → (suc 𝑦𝑤 → suc 𝑦 = 𝑤))))
5423, 53syl7 69 . . . . . 6 (𝑦 ∈ ω → (∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧) → (𝑤 ∈ ω → (suc 𝑦𝑤 → suc 𝑦 = 𝑤))))
5554ralrimdv 2611 . . . . 5 (𝑦 ∈ ω → (∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧) → ∀𝑤 ∈ ω (suc 𝑦𝑤 → suc 𝑦 = 𝑤)))
56 breq2 4092 . . . . . . 7 (𝑤 = 𝑧 → (suc 𝑦𝑤 ↔ suc 𝑦𝑧))
57 eqeq2 2241 . . . . . . 7 (𝑤 = 𝑧 → (suc 𝑦 = 𝑤 ↔ suc 𝑦 = 𝑧))
5856, 57imbi12d 234 . . . . . 6 (𝑤 = 𝑧 → ((suc 𝑦𝑤 → suc 𝑦 = 𝑤) ↔ (suc 𝑦𝑧 → suc 𝑦 = 𝑧)))
5958cbvralv 2767 . . . . 5 (∀𝑤 ∈ ω (suc 𝑦𝑤 → suc 𝑦 = 𝑤) ↔ ∀𝑧 ∈ ω (suc 𝑦𝑧 → suc 𝑦 = 𝑧))
6055, 59imbitrdi 161 . . . 4 (𝑦 ∈ ω → (∀𝑧 ∈ ω (𝑦𝑧𝑦 = 𝑧) → ∀𝑧 ∈ ω (suc 𝑦𝑧 → suc 𝑦 = 𝑧)))
614, 8, 12, 16, 22, 60finds 4698 . . 3 (𝐴 ∈ ω → ∀𝑧 ∈ ω (𝐴𝑧𝐴 = 𝑧))
62 breq2 4092 . . . . 5 (𝑧 = 𝐵 → (𝐴𝑧𝐴𝐵))
63 eqeq2 2241 . . . . 5 (𝑧 = 𝐵 → (𝐴 = 𝑧𝐴 = 𝐵))
6462, 63imbi12d 234 . . . 4 (𝑧 = 𝐵 → ((𝐴𝑧𝐴 = 𝑧) ↔ (𝐴𝐵𝐴 = 𝐵)))
6564rspcv 2906 . . 3 (𝐵 ∈ ω → (∀𝑧 ∈ ω (𝐴𝑧𝐴 = 𝑧) → (𝐴𝐵𝐴 = 𝐵)))
6661, 65mpan9 281 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵𝐴 = 𝐵))
67 eqeng 6938 . . 3 (𝐴 ∈ ω → (𝐴 = 𝐵𝐴𝐵))
6867adantr 276 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 = 𝐵𝐴𝐵))
6966, 68impbid 129 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴𝐵𝐴 = 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wo 715   = wceq 1397  wcel 2202  wral 2510  wrex 2511  c0 3494   class class class wbr 4088  suc csuc 4462  ωcom 4688  cen 6906
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-er 6701  df-en 6909
This theorem is referenced by:  findcard2  7077  findcard2s  7078  fidcen  7087  unsnfidcex  7111  unsnfidcel  7112  exmidonfinlem  7403  hashen  11045  hashunlem  11066
  Copyright terms: Public domain W3C validator