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

Theorem fin1a2lem4 10518
Description: Lemma for fin1a2 10530. (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 8687 . . . 4 2o ∈ ω
3 nnmcl 8657 . . . 4 ((2o ∈ ω ∧ 𝑥 ∈ ω) → (2o ·o 𝑥) ∈ ω)
42, 3mpan 703 . . 3 (𝑥 ∈ ω → (2o ·o 𝑥) ∈ ω)
51, 4fmpti 7142 . 2 𝐸:ω⟶ω
61fin1a2lem3 10517 . . . . . 6 (𝑎 ∈ ω → (𝐸‘𝑎) = (2o ·o 𝑎))
71fin1a2lem3 10517 . . . . . 6 (𝑏 ∈ ω → (𝐸‘𝑏) = (2o ·o 𝑏))
86, 7eqeqan12d 2777 . . . . 5 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((𝐸‘𝑎) = (𝐸‘𝑏) ↔ (2o ·o 𝑎) = (2o ·o 𝑏)))
9 2on 8526 . . . . . . 7 2o ∈ On
109a1i 11 . . . . . 6 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → 2o ∈ On)
11 nnon 7915 . . . . . . 7 (𝑎 ∈ ω → 𝑎 ∈ On)
1211adantr 486 . . . . . 6 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → 𝑎 ∈ On)
13 nnon 7915 . . . . . . 7 (𝑏 ∈ ω → 𝑏 ∈ On)
1413adantl 487 . . . . . 6 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → 𝑏 ∈ On)
15 0lt1o 8548 . . . . . . . . 9 ∅ ∈ 1o
16 elelsuc 6462 . . . . . . . . 9 (∅ ∈ 1o → ∅ ∈ suc 1o)
1715, 16ax-mp 5 . . . . . . . 8 ∅ ∈ suc 1o
18 df-2o 8513 . . . . . . . 8 2o = suc 1o
1917, 18eleqtrri 2863 . . . . . . 7 ∅ ∈ 2o
2019a1i 11 . . . . . 6 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ∅ ∈ 2o)
21 omcan 8613 . . . . . 6 (((2o ∈ On ∧ 𝑎 ∈ On ∧ 𝑏 ∈ On) ∧ ∅ ∈ 2o) → ((2o ·o 𝑎) = (2o ·o 𝑏) ↔ 𝑎 = 𝑏))
2210, 12, 14, 20, 21syl31anc 1401 . . . . 5 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((2o ·o 𝑎) = (2o ·o 𝑏) ↔ 𝑎 = 𝑏))
238, 22bitrd 282 . . . 4 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((𝐸‘𝑎) = (𝐸‘𝑏) ↔ 𝑎 = 𝑏))
2423biimpd 232 . . 3 ((𝑎 ∈ ω ∧ 𝑏 ∈ ω) → ((𝐸‘𝑎) = (𝐸‘𝑏) → 𝑎 = 𝑏))
2524rgen2 3206 . 2 ∀𝑎 ∈ ω ∀𝑏 ∈ ω ((𝐸‘𝑎) = (𝐸‘𝑏) → 𝑎 = 𝑏)
26 dff13 7287 . 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 2147  ∀wral 3080  ∅c0 4281   ↦ cmpt 5190  Oncon0 6386  suc csuc 6388  ⟶wf 6560  ⟶1-1wf1 6561  ‘cfv 6564  (class class class)co 7449  ωcom 7909  1oc1o 8505  2oc2o 8506   ·o comu 8510
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396  ax-un 7781
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6328  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-ov 7452  df-oprab 7453  df-mpo 7454  df-om 7910  df-2nd 8034  df-frecs 8335  df-wrecs 8366  df-recs 8415  df-rdg 8454  df-1o 8512  df-2o 8513  df-oadd 8516  df-omul 8517
This theorem is used by:  fin1a2lem5  10519  fin1a2lem6  10520  fin1a2lem7  10521
  Copyright terms: Public domain W3C validator