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

Theorem fin1a2lem5 10482
Description: Lemma for fin1a2 10493. (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 8665 . 2 (𝐴 ∈ ω → (∃𝑎 ∈ ω 𝐴 = (2o ·o 𝑎) ↔ ¬ ∃𝑎 ∈ ω suc 𝐴 = (2o ·o 𝑎)))
2 fin1a2lem.b . . . . . 6 𝐸 = (𝑥 ∈ ω ↦ (2o ·o 𝑥))
32fin1a2lem4 10481 . . . . 5 𝐸:ω–1-1→ω
4 f1fn 6779 . . . . 5 (𝐸:ω–1-1→ω → 𝐸 Fn ω)
53, 4ax-mp 5 . . . 4 𝐸 Fn ω
6 fvelrnb 6945 . . . 4 (𝐸 Fn ω → (𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω (𝐸‘𝑎) = 𝐴))
75, 6ax-mp 5 . . 3 (𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω (𝐸‘𝑎) = 𝐴)
8 eqcom 2767 . . . . 5 ((𝐸‘𝑎) = 𝐴 ↔ 𝐴 = (𝐸‘𝑎))
92fin1a2lem3 10480 . . . . . 6 (𝑎 ∈ ω → (𝐸‘𝑎) = (2o ·o 𝑎))
109eqeq2d 2771 . . . . 5 (𝑎 ∈ ω → (𝐴 = (𝐸‘𝑎) ↔ 𝐴 = (2o ·o 𝑎)))
118, 10bitrid 286 . . . 4 (𝑎 ∈ ω → ((𝐸‘𝑎) = 𝐴 ↔ 𝐴 = (2o ·o 𝑎)))
1211rexbiia 3107 . . 3 (∃𝑎 ∈ ω (𝐸‘𝑎) = 𝐴 ↔ ∃𝑎 ∈ ω 𝐴 = (2o ·o 𝑎))
137, 12bitri 278 . 2 (𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω 𝐴 = (2o ·o 𝑎))
14 fvelrnb 6945 . . . . 5 (𝐸 Fn ω → (suc 𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω (𝐸‘𝑎) = suc 𝐴))
155, 14ax-mp 5 . . . 4 (suc 𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω (𝐸‘𝑎) = suc 𝐴)
16 eqcom 2767 . . . . . 6 ((𝐸‘𝑎) = suc 𝐴 ↔ suc 𝐴 = (𝐸‘𝑎))
179eqeq2d 2771 . . . . . 6 (𝑎 ∈ ω → (suc 𝐴 = (𝐸‘𝑎) ↔ suc 𝐴 = (2o ·o 𝑎)))
1816, 17bitrid 286 . . . . 5 (𝑎 ∈ ω → ((𝐸‘𝑎) = suc 𝐴 ↔ suc 𝐴 = (2o ·o 𝑎)))
1918rexbiia 3107 . . . 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 1569   ∈ wcel 2144  ∃wrex 3086   ↦ cmpt 5185  ran crn 5651  suc csuc 6364   Fn wfn 6533  –1-1→wf1 6535  ‘cfv 6538  (class class class)co 7420  ωcom 7877  2oc2o 8470   ·o comu 8474
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 7751
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 4584  df-pr 4586  df-op 4590  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 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-2o 8477  df-oadd 8480  df-omul 8481
This theorem is used by:  fin1a2lem6  10483
  Copyright terms: Public domain W3C validator