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

Theorem fin1a2lem5 10521
Description: Lemma for fin1a2 10532. (Contributed by Stefan O'Rear, 7-Nov-2014.)
Hypothesis
Ref Expression
fin1a2lem.b 𝐸 = (𝑥 ∈ ω ↦ (2o ·o 𝑥))
Assertion
Ref Expression
fin1a2lem5 (𝐴 ∈ ω → (𝐴 ∈ ran 𝐸 ↔ ¬ suc 𝐴 ∈ ran 𝐸))

Proof of Theorem fin1a2lem5
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 nneob 8703 . 2 (𝐴 ∈ ω → (∃𝑎 ∈ ω 𝐴 = (2o ·o 𝑎) ↔ ¬ ∃𝑎 ∈ ω suc 𝐴 = (2o ·o 𝑎)))
2 fin1a2lem.b . . . . . 6 𝐸 = (𝑥 ∈ ω ↦ (2o ·o 𝑥))
32fin1a2lem4 10520 . . . . 5 𝐸:ω⟶1-1ω
4 f1fn 6809 . . . . 5 (𝐸:ω⟶1-1ω → 𝐸 Fn ω)
53, 4ax-mp 5 . . . 4 𝐸 Fn ω
6 fvelrnb 6976 . . . 4 (𝐸 Fn ω → (𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω (𝐸‘𝑎) = 𝐴))
75, 6ax-mp 5 . . 3 (𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω (𝐸‘𝑎) = 𝐴)
8 eqcom 2770 . . . . 5 ((𝐸‘𝑎) = 𝐴 ↔ 𝐴 = (𝐸‘𝑎))
92fin1a2lem3 10519 . . . . . 6 (𝑎 ∈ ω → (𝐸‘𝑎) = (2o ·o 𝑎))
109eqeq2d 2774 . . . . 5 (𝑎 ∈ ω → (𝐴 = (𝐸‘𝑎) ↔ 𝐴 = (2o ·o 𝑎)))
118, 10bitrid 286 . . . 4 (𝑎 ∈ ω → ((𝐸‘𝑎) = 𝐴 ↔ 𝐴 = (2o ·o 𝑎)))
1211rexbiia 3111 . . 3 (∃𝑎 ∈ ω (𝐸‘𝑎) = 𝐴 ↔ ∃𝑎 ∈ ω 𝐴 = (2o ·o 𝑎))
137, 12bitri 278 . 2 (𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω 𝐴 = (2o ·o 𝑎))
14 fvelrnb 6976 . . . . 5 (𝐸 Fn ω → (suc 𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω (𝐸‘𝑎) = suc 𝐴))
155, 14ax-mp 5 . . . 4 (suc 𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω (𝐸‘𝑎) = suc 𝐴)
16 eqcom 2770 . . . . . 6 ((𝐸‘𝑎) = suc 𝐴 ↔ suc 𝐴 = (𝐸‘𝑎))
179eqeq2d 2774 . . . . . 6 (𝑎 ∈ ω → (suc 𝐴 = (𝐸‘𝑎) ↔ suc 𝐴 = (2o ·o 𝑎)))
1816, 17bitrid 286 . . . . 5 (𝑎 ∈ ω → ((𝐸‘𝑎) = suc 𝐴 ↔ suc 𝐴 = (2o ·o 𝑎)))
1918rexbiia 3111 . . . 4 (∃𝑎 ∈ ω (𝐸‘𝑎) = suc 𝐴 ↔ ∃𝑎 ∈ ω suc 𝐴 = (2o ·o 𝑎))
2015, 19bitri 278 . . 3 (suc 𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω suc 𝐴 = (2o ·o 𝑎))
2120notbii 323 . 2 (¬ suc 𝐴 ∈ ran 𝐸 ↔ ¬ ∃𝑎 ∈ ω suc 𝐴 = (2o ·o 𝑎))
221, 13, 213bitr4g 317 1 (𝐴 ∈ ω → (𝐴 ∈ ran 𝐸 ↔ ¬ suc 𝐴 ∈ ran 𝐸))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ↦ cmpt 5192  ran crn 5659  suc csuc 6390   Fn wfn 6561  ⟶1-1wf1 6563  ‘cfv 6566  (class class class)co 7451  ωcom 7911  2oc2o 8508   ·o comu 8512
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 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-oadd 8518  df-omul 8519
This theorem is used by:  fin1a2lem6  10522
  Copyright terms: Public domain W3C validator