Theorem fin23lem38 10440

Description: Lemma for fin23 10480. The contradictory chain has no minimum. (Contributed by Stefan O'Rear, 2-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.)

Hypotheses

Ref	Expression
fin23lem33.f	⊢ 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) → ∩ ran 𝑎 ∈ ran 𝑎)}
fin23lem.f	⊢ (𝜑 → ℎ:ω–1-1→V)
fin23lem.g	⊢ (𝜑 → ∪ ran ℎ ⊆ 𝐺)
fin23lem.h	⊢ (𝜑 → ∀𝑗((𝑗:ω–1-1→V ∧ ∪ ran 𝑗 ⊆ 𝐺) → ((𝑖‘𝑗):ω–1-1→V ∧ ∪ ran (𝑖‘𝑗) ⊊ ∪ ran 𝑗)))
fin23lem.i	⊢ 𝑌 = (rec(𝑖, ℎ) ↾ ω)

Assertion

Ref	Expression
fin23lem38	⊢ (𝜑 → ¬ ∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ∈ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)))

Distinct variable groups:   𝑎,𝑏,𝑔,𝑖,𝑗,𝑥,ℎ,𝐺   𝐹,𝑎   𝜑,𝑎,𝑏,𝑗   𝑌,𝑎,𝑏,𝑗

Allowed substitution hints:   𝜑(𝑥, 𝑔, ℎ, 𝑖)   𝐹(𝑥, 𝑔, ℎ, 𝑖, 𝑗, 𝑏)   𝑌(𝑥, 𝑔, ℎ, 𝑖)

Proof of Theorem fin23lem38

Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		peano2 7911	. . . . . . . 8 ⊢ (𝑑 ∈ ω → suc 𝑑 ∈ ω)
2		eqid 2763	. . . . . . . . . 10 ⊢ ∪ ran (𝑌‘suc 𝑑) = ∪ ran (𝑌‘suc 𝑑)
3		fveq2 6896	. . . . . . . . . . . . 13 ⊢ (𝑏 = suc 𝑑 → (𝑌‘𝑏) = (𝑌‘suc 𝑑))
4	3	rneqd 5925	. . . . . . . . . . . 12 ⊢ (𝑏 = suc 𝑑 → ran (𝑌‘𝑏) = ran (𝑌‘suc 𝑑))
5	4	unieqd 4883	. . . . . . . . . . 11 ⊢ (𝑏 = suc 𝑑 → ∪ ran (𝑌‘𝑏) = ∪ ran (𝑌‘suc 𝑑))
6	5	rspceeqv 3602	. . . . . . . . . 10 ⊢ ((suc 𝑑 ∈ ω ∧ ∪ ran (𝑌‘suc 𝑑) = ∪ ran (𝑌‘suc 𝑑)) → ∃𝑏 ∈ ω ∪ ran (𝑌‘suc 𝑑) = ∪ ran (𝑌‘𝑏))
7	2, 6	mpan2 704	. . . . . . . . 9 ⊢ (suc 𝑑 ∈ ω → ∃𝑏 ∈ ω ∪ ran (𝑌‘suc 𝑑) = ∪ ran (𝑌‘𝑏))
8		fvex 6909	. . . . . . . . . . . 12 ⊢ (𝑌‘suc 𝑑) ∈ V
9	8	rnex 7932	. . . . . . . . . . 11 ⊢ ran (𝑌‘suc 𝑑) ∈ V
10	9	uniex 7768	. . . . . . . . . 10 ⊢ ∪ ran (𝑌‘suc 𝑑) ∈ V
11		eqid 2763	. . . . . . . . . . 11 ⊢ (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) = (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏))
12	11	elrnmpt 5945	. . . . . . . . . 10 ⊢ (∪ ran (𝑌‘suc 𝑑) ∈ V → (∪ ran (𝑌‘suc 𝑑) ∈ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ↔ ∃𝑏 ∈ ω ∪ ran (𝑌‘suc 𝑑) = ∪ ran (𝑌‘𝑏)))
13	10, 12	ax-mp 5	. . . . . . . . 9 ⊢ (∪ ran (𝑌‘suc 𝑑) ∈ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ↔ ∃𝑏 ∈ ω ∪ ran (𝑌‘suc 𝑑) = ∪ ran (𝑌‘𝑏))
14	7, 13	sylibr 237	. . . . . . . 8 ⊢ (suc 𝑑 ∈ ω → ∪ ran (𝑌‘suc 𝑑) ∈ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)))
15	1, 14	syl 18	. . . . . . 7 ⊢ (𝑑 ∈ ω → ∪ ran (𝑌‘suc 𝑑) ∈ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)))
16	15	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑑 ∈ ω) → ∪ ran (𝑌‘suc 𝑑) ∈ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)))
17		intss1 4926	. . . . . 6 ⊢ (∪ ran (𝑌‘suc 𝑑) ∈ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) → ∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ⊆ ∪ ran (𝑌‘suc 𝑑))
18	16, 17	syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑑 ∈ ω) → ∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ⊆ ∪ ran (𝑌‘suc 𝑑))
19		fin23lem33.f	. . . . . 6 ⊢ 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) → ∩ ran 𝑎 ∈ ran 𝑎)}
20		fin23lem.f	. . . . . 6 ⊢ (𝜑 → ℎ:ω–1-1→V)
21		fin23lem.g	. . . . . 6 ⊢ (𝜑 → ∪ ran ℎ ⊆ 𝐺)
22		fin23lem.h	. . . . . 6 ⊢ (𝜑 → ∀𝑗((𝑗:ω–1-1→V ∧ ∪ ran 𝑗 ⊆ 𝐺) → ((𝑖‘𝑗):ω–1-1→V ∧ ∪ ran (𝑖‘𝑗) ⊊ ∪ ran 𝑗)))
23		fin23lem.i	. . . . . 6 ⊢ 𝑌 = (rec(𝑖, ℎ) ↾ ω)
24	19, 20, 21, 22, 23	fin23lem35 10438	. . . . 5 ⊢ ((𝜑 ∧ 𝑑 ∈ ω) → ∪ ran (𝑌‘suc 𝑑) ⊊ ∪ ran (𝑌‘𝑑))
25	18, 24	sspsstrd 4042	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ ω) → ∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ⊊ ∪ ran (𝑌‘𝑑))
26		dfpss2 4018	. . . . 5 ⊢ (∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ⊊ ∪ ran (𝑌‘𝑑) ↔ (∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ⊆ ∪ ran (𝑌‘𝑑) ∧ ¬ ∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) = ∪ ran (𝑌‘𝑑)))
27	26	simprbi 503	. . . 4 ⊢ (∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ⊊ ∪ ran (𝑌‘𝑑) → ¬ ∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) = ∪ ran (𝑌‘𝑑))
28	25, 27	syl 18	. . 3 ⊢ ((𝜑 ∧ 𝑑 ∈ ω) → ¬ ∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) = ∪ ran (𝑌‘𝑑))
29	28	nrexdv 3161	. 2 ⊢ (𝜑 → ¬ ∃𝑑 ∈ ω ∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) = ∪ ran (𝑌‘𝑑))
30		fveq2 6896	. . . . . . 7 ⊢ (𝑏 = 𝑑 → (𝑌‘𝑏) = (𝑌‘𝑑))
31	30	rneqd 5925	. . . . . 6 ⊢ (𝑏 = 𝑑 → ran (𝑌‘𝑏) = ran (𝑌‘𝑑))
32	31	unieqd 4883	. . . . 5 ⊢ (𝑏 = 𝑑 → ∪ ran (𝑌‘𝑏) = ∪ ran (𝑌‘𝑑))
33	32	cbvmptv 5212	. . . 4 ⊢ (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) = (𝑑 ∈ ω ↦ ∪ ran (𝑌‘𝑑))
34	33	elrnmpt 5945	. . 3 ⊢ (∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ∈ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) → (∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ∈ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ↔ ∃𝑑 ∈ ω ∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) = ∪ ran (𝑌‘𝑑)))
35	34	ibi 270	. 2 ⊢ (∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ∈ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) → ∃𝑑 ∈ ω ∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) = ∪ ran (𝑌‘𝑑))
36	29, 35	nsyl 141	1 ⊢ (𝜑 → ¬ ∩ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)) ∈ ran (𝑏 ∈ ω ↦ ∪ ran (𝑌‘𝑏)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567   = wceq 1569   ∈ wcel 2146  {cab 2741  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ⊊ wpss 4016  𝒫 cpw 4560  ∪ cuni 4870  ∩ cint 4910   ↦ cmpt 5189  ran crn 5656   ↾ cres 5657  suc csuc 6371  –1-1→wf1 6544  ‘cfv 6547  (class class class)co 7430  ωcom 7887  reccrdg 8431   ↑_m cmap 8861

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7761

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 2101  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-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6311  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-ov 7433  df-om 7888  df-2nd 8012  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432

This theorem is used by:  fin23lem39  10441