MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fin1a2lem4 Structured version   Visualization version   GIF version

Theorem fin1a2lem4 10474
Description: Lemma for fin1a2 10486. (Contributed by Stefan O'Rear, 7-Nov-2014.)
Hypothesis
Ref Expression
fin1a2lem.b 𝐸 = (𝑥 ∈ ω ↦ (2o ·o 𝑥))
Assertion
Ref Expression
fin1a2lem4 𝐸:ω–1-1→ω

Proof of Theorem fin1a2lem4
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fin1a2lem.b . . 3 𝐸 = (𝑥 ∈ ω ↦ (2o ·o 𝑥))
2 2onn 8644 . . . 4 2o ∈ ω
3 nnmcl 8614 . . . 4 ((2o ∈ ω ∧ 𝑥 ∈ ω) → (2o ·o 𝑥) ∈ ω)
42, 3mpan 703 . . 3 (𝑥 ∈ ω → (2o ·o 𝑥) ∈ ω)
51, 4fmpti 7110 . 2 𝐸:ω⟶ω
61fin1a2lem3 10473 . . . . . 6 (𝑎 ∈ ω → (𝐸‘𝑎) = (2o ·o 𝑎))
71fin1a2lem3 10473 . . . . . 6 (𝑏 ∈ ω → (𝐸‘𝑏) = (2o ·o 𝑏))
86, 7eqeqan12d 2775 . . . . 5 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((𝐸‘𝑎) = (𝐸‘𝑏) ↔ (2o ·o 𝑎) = (2o ·o 𝑏)))
9 2on 8483 . . . . . . 7 2o ∈ On
109a1i 11 . . . . . 6 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → 2o ∈ On)
11 nnon 7881 . . . . . . 7 (𝑎 ∈ ω → 𝑎 ∈ On)
1211adantr 486 . . . . . 6 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → 𝑎 ∈ On)
13 nnon 7881 . . . . . . 7 (𝑏 ∈ ω → 𝑏 ∈ On)
1413adantl 487 . . . . . 6 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → 𝑏 ∈ On)
15 0lt1o 8505 . . . . . . . . 9 ∅ ∈ 1o
16 elelsuc 6437 . . . . . . . . 9 (∅ ∈ 1o → ∅ ∈ suc 1o)
1715, 16ax-mp 5 . . . . . . . 8 ∅ ∈ suc 1o
18 df-2o 8470 . . . . . . . 8 2o = suc 1o
1917, 18eleqtrri 2860 . . . . . . 7 ∅ ∈ 2o
2019a1i 11 . . . . . 6 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ∅ ∈ 2o)
21 omcan 8570 . . . . . 6 (((2o ∈ On ∧ 𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ ∅ ∈ 2o) → ((2o ·o 𝑎) = (2o ·o 𝑏) ↔ 𝑎 = 𝑏))
2210, 12, 14, 20, 21syl31anc 1400 . . . . 5 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((2o ·o 𝑎) = (2o ·o 𝑏) ↔ 𝑎 = 𝑏))
238, 22bitrd 282 . . . 4 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((𝐸‘𝑎) = (𝐸‘𝑏) ↔ 𝑎 = 𝑏))
2423biimpd 232 . . 3 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((𝐸‘𝑎) = (𝐸‘𝑏) → 𝑎 = 𝑏))
2524rgen2 3203 . 2 ∀𝑎 ∈ ω ∀𝑏 ∈ ω ((𝐸‘𝑎) = (𝐸‘𝑏) → 𝑎 = 𝑏)
26 dff13 7256 . 2 (𝐸:ω–1-1→ω ↔ (𝐸:ω⟶ω ∧ ∀𝑎 ∈ ω ∀𝑏 ∈ ω ((𝐸‘𝑎) = (𝐸‘𝑏) → 𝑎 = 𝑏)))
275, 25, 26mpbir2an 724 1 𝐸:ω–1-1→ω
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∅c0 4279   ↦ cmpt 5186  Oncon0 6361  suc csuc 6363  ⟶wf 6533  –1-1→wf1 6534  ‘cfv 6537  (class class class)co 7418  ωcom 7875  1oc1o 8462  2oc2o 8463   ·o comu 8467
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-2o 8470  df-oadd 8473  df-omul 8474
This theorem is used by:  fin1a2lem5  10475  fin1a2lem6  10476  fin1a2lem7  10477
  Copyright terms: Public domain W3C validator