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

Theorem fin1a2lem4 10485
Description: Lemma for fin1a2 10497. (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 8655 . . . 4 2o ∈ ω
3 nnmcl 8625 . . . 4 ((2o ∈ ω ∧ 𝑥 ∈ ω) → (2o ·o 𝑥) ∈ ω)
42, 3mpan 703 . . 3 (𝑥 ∈ ω → (2o ·o 𝑥) ∈ ω)
51, 4fmpti 7113 . 2 𝐸:ω⟶ω
61fin1a2lem3 10484 . . . . . 6 (𝑎 ∈ ω → (𝐸‘𝑎) = (2o ·o 𝑎))
71fin1a2lem3 10484 . . . . . 6 (𝑏 ∈ ω → (𝐸‘𝑏) = (2o ·o 𝑏))
86, 7eqeqan12d 2774 . . . . 5 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((𝐸‘𝑎) = (𝐸‘𝑏) ↔ (2o ·o 𝑎) = (2o ·o 𝑏)))
9 2on 8494 . . . . . . 7 2o ∈ On
109a1i 11 . . . . . 6 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → 2o ∈ On)
11 nnon 7884 . . . . . . 7 (𝑎 ∈ ω → 𝑎 ∈ On)
1211adantr 486 . . . . . 6 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → 𝑎 ∈ On)
13 nnon 7884 . . . . . . 7 (𝑏 ∈ ω → 𝑏 ∈ On)
1413adantl 487 . . . . . 6 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → 𝑏 ∈ On)
15 0lt1o 8516 . . . . . . . . 9 ∅ ∈ 1o
16 elelsuc 6438 . . . . . . . . 9 (∅ ∈ 1o → ∅ ∈ suc 1o)
1715, 16ax-mp 5 . . . . . . . 8 ∅ ∈ suc 1o
18 df-2o 8481 . . . . . . . 8 2o = suc 1o
1917, 18eleqtrri 2859 . . . . . . 7 ∅ ∈ 2o
2019a1i 11 . . . . . 6 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ∅ ∈ 2o)
21 omcan 8581 . . . . . 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 3202 . 2 ∀𝑎 ∈ ω ∀𝑏 ∈ ω ((𝐸‘𝑎) = (𝐸‘𝑏) → 𝑎 = 𝑏)
26 dff13 7259 . 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 1569   ∈ wcel 2144  ∀wral 3076  ∅c0 4278   ↦ cmpt 5185  Oncon0 6362  suc csuc 6364  ⟶wf 6535  –1-1→wf1 6536  ‘cfv 6539  (class class class)co 7421  ωcom 7878  1oc1o 8473  2oc2o 8474   ·o comu 8478
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-om 7879  df-2nd 8003  df-frecs 8303  df-wrecs 8334  df-recs 8383  df-rdg 8422  df-1o 8480  df-2o 8481  df-oadd 8484  df-omul 8485
This theorem is used by:  fin1a2lem5  10486  fin1a2lem6  10487  fin1a2lem7  10488
  Copyright terms: Public domain W3C validator