Theorem fin1a2lem5 10475

Description: Lemma for fin1a2 10486. (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.

Step	Hyp	Ref	Expression
1		nneob 8658	. 2 ⊢ (𝐴 ∈ ω → (∃𝑎 ∈ ω 𝐴 = (2o ·o 𝑎) ↔ ¬ ∃𝑎 ∈ ω suc 𝐴 = (2o ·o 𝑎)))
2		fin1a2lem.b	. . . . . 6 ⊢ 𝐸 = (𝑥 ∈ ω ↦ (2o ·o 𝑥))
3	2	fin1a2lem4 10474	. . . . 5 ⊢ 𝐸:ω–1-1→ω
4		f1fn 6777	. . . . 5 ⊢ (𝐸:ω–1-1→ω → 𝐸 Fn ω)
5	3, 4	ax-mp 5	. . . 4 ⊢ 𝐸 Fn ω
6		fvelrnb 6943	. . . 4 ⊢ (𝐸 Fn ω → (𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω (𝐸‘𝑎) = 𝐴))
7	5, 6	ax-mp 5	. . 3 ⊢ (𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω (𝐸‘𝑎) = 𝐴)
8		eqcom 2768	. . . . 5 ⊢ ((𝐸‘𝑎) = 𝐴 ↔ 𝐴 = (𝐸‘𝑎))
9	2	fin1a2lem3 10473	. . . . . 6 ⊢ (𝑎 ∈ ω → (𝐸‘𝑎) = (2o ·o 𝑎))
10	9	eqeq2d 2772	. . . . 5 ⊢ (𝑎 ∈ ω → (𝐴 = (𝐸‘𝑎) ↔ 𝐴 = (2o ·o 𝑎)))
11	8, 10	bitrid 286	. . . 4 ⊢ (𝑎 ∈ ω → ((𝐸‘𝑎) = 𝐴 ↔ 𝐴 = (2o ·o 𝑎)))
12	11	rexbiia 3108	. . 3 ⊢ (∃𝑎 ∈ ω (𝐸‘𝑎) = 𝐴 ↔ ∃𝑎 ∈ ω 𝐴 = (2o ·o 𝑎))
13	7, 12	bitri 278	. 2 ⊢ (𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω 𝐴 = (2o ·o 𝑎))
14		fvelrnb 6943	. . . . 5 ⊢ (𝐸 Fn ω → (suc 𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω (𝐸‘𝑎) = suc 𝐴))
15	5, 14	ax-mp 5	. . . 4 ⊢ (suc 𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω (𝐸‘𝑎) = suc 𝐴)
16		eqcom 2768	. . . . . 6 ⊢ ((𝐸‘𝑎) = suc 𝐴 ↔ suc 𝐴 = (𝐸‘𝑎))
17	9	eqeq2d 2772	. . . . . 6 ⊢ (𝑎 ∈ ω → (suc 𝐴 = (𝐸‘𝑎) ↔ suc 𝐴 = (2o ·o 𝑎)))
18	16, 17	bitrid 286	. . . . 5 ⊢ (𝑎 ∈ ω → ((𝐸‘𝑎) = suc 𝐴 ↔ suc 𝐴 = (2o ·o 𝑎)))
19	18	rexbiia 3108	. . . 4 ⊢ (∃𝑎 ∈ ω (𝐸‘𝑎) = suc 𝐴 ↔ ∃𝑎 ∈ ω suc 𝐴 = (2o ·o 𝑎))
20	15, 19	bitri 278	. . 3 ⊢ (suc 𝐴 ∈ ran 𝐸 ↔ ∃𝑎 ∈ ω suc 𝐴 = (2o ·o 𝑎))
21	20	notbii 323	. 2 ⊢ (¬ suc 𝐴 ∈ ran 𝐸 ↔ ¬ ∃𝑎 ∈ ω suc 𝐴 = (2o ·o 𝑎))
22	1, 13, 21	3bitr4g 317	1 ⊢ (𝐴 ∈ ω → (𝐴 ∈ ran 𝐸 ↔ ¬ suc 𝐴 ∈ ran 𝐸))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145  ∃wrex 3087   ↦ cmpt 5186  ran crn 5652  suc csuc 6363   Fn wfn 6532  –1-1→wf1 6534  ‘cfv 6537  (class class class)co 7418  ωcom 7875  2_oc2o 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:  fin1a2lem6  10476