Theorem fin23lem36 10338

Description: Lemma for fin23 10379. Weak order property of 𝑌. (Contributed by Stefan O'Rear, 2-Nov-2014.)

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
fin23lem36	⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝐴 ∧ 𝜑)) → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵))

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

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

Proof of Theorem fin23lem36

Dummy variable 𝑏 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6881	. . . . . . 7 ⊢ (𝑎 = 𝐵 → (𝑌‘𝑎) = (𝑌‘𝐵))
2	1	rneqd 5927	. . . . . 6 ⊢ (𝑎 = 𝐵 → ran (𝑌‘𝑎) = ran (𝑌‘𝐵))
3	2	unieqd 4884	. . . . 5 ⊢ (𝑎 = 𝐵 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘𝐵))
4	3	sseq1d 3967	. . . 4 ⊢ (𝑎 = 𝐵 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵)))
5	4	imbi2d 343	. . 3 ⊢ (𝑎 = 𝐵 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵))))
6		fveq2 6881	. . . . . . 7 ⊢ (𝑎 = 𝑏 → (𝑌‘𝑎) = (𝑌‘𝑏))
7	6	rneqd 5927	. . . . . 6 ⊢ (𝑎 = 𝑏 → ran (𝑌‘𝑎) = ran (𝑌‘𝑏))
8	7	unieqd 4884	. . . . 5 ⊢ (𝑎 = 𝑏 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘𝑏))
9	8	sseq1d 3967	. . . 4 ⊢ (𝑎 = 𝑏 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
10	9	imbi2d 343	. . 3 ⊢ (𝑎 = 𝑏 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
11		fveq2 6881	. . . . . . 7 ⊢ (𝑎 = suc 𝑏 → (𝑌‘𝑎) = (𝑌‘suc 𝑏))
12	11	rneqd 5927	. . . . . 6 ⊢ (𝑎 = suc 𝑏 → ran (𝑌‘𝑎) = ran (𝑌‘suc 𝑏))
13	12	unieqd 4884	. . . . 5 ⊢ (𝑎 = suc 𝑏 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘suc 𝑏))
14	13	sseq1d 3967	. . . 4 ⊢ (𝑎 = suc 𝑏 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
15	14	imbi2d 343	. . 3 ⊢ (𝑎 = suc 𝑏 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
16		fveq2 6881	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (𝑌‘𝑎) = (𝑌‘𝐴))
17	16	rneqd 5927	. . . . . 6 ⊢ (𝑎 = 𝐴 → ran (𝑌‘𝑎) = ran (𝑌‘𝐴))
18	17	unieqd 4884	. . . . 5 ⊢ (𝑎 = 𝐴 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘𝐴))
19	18	sseq1d 3967	. . . 4 ⊢ (𝑎 = 𝐴 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵)))
20	19	imbi2d 343	. . 3 ⊢ (𝑎 = 𝐴 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵))))
21		ssid 3958	. . . 4 ⊢ ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵)
22	21	2a1i 12	. . 3 ⊢ (𝐵 ∈ ω → (𝜑 → ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵)))
23		simprr 784	. . . . . . . 8 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → 𝜑)
24		simpll 778	. . . . . . . 8 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → 𝑏 ∈ ω)
25		fin23lem33.f	. . . . . . . . 9 ⊢ 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) → ∩ ran 𝑎 ∈ ran 𝑎)}
26		fin23lem.f	. . . . . . . . 9 ⊢ (𝜑 → ℎ:ω–1-1→V)
27		fin23lem.g	. . . . . . . . 9 ⊢ (𝜑 → ∪ ran ℎ ⊆ 𝐺)
28		fin23lem.h	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑗((𝑗:ω–1-1→V ∧ ∪ ran 𝑗 ⊆ 𝐺) → ((𝑖‘𝑗):ω–1-1→V ∧ ∪ ran (𝑖‘𝑗) ⊊ ∪ ran 𝑗)))
29		fin23lem.i	. . . . . . . . 9 ⊢ 𝑌 = (rec(𝑖, ℎ) ↾ ω)
30	25, 26, 27, 28, 29	fin23lem35 10337	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ ω) → ∪ ran (𝑌‘suc 𝑏) ⊊ ∪ ran (𝑌‘𝑏))
31	23, 24, 30	syl2anc 595	. . . . . . 7 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → ∪ ran (𝑌‘suc 𝑏) ⊊ ∪ ran (𝑌‘𝑏))
32	31	pssssd 4053	. . . . . 6 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝑏))
33		sstr2 3943	. . . . . 6 ⊢ (∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝑏) → (∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
34	32, 33	syl 18	. . . . 5 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → (∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
35	34	expr 461	. . . 4 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐵 ⊆ 𝑏) → (𝜑 → (∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
36	35	a2d 30	. . 3 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐵 ⊆ 𝑏) → ((𝜑 → ∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵)) → (𝜑 → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
37	5, 10, 15, 20, 22, 36	findsg 7892	. 2 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐵 ⊆ 𝐴) → (𝜑 → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵)))
38	37	impr 459	1 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝐴 ∧ 𝜑)) → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400  ∀wal 1567   = wceq 1569   ∈ wcel 2142  {cab 2740  ∀wral 3078  Vcvv 3454   ⊆ wss 3904   ⊊ wpss 3905  𝒫 cpw 4561  ∪ cuni 4871  ∩ cint 4911  ran crn 5661   ↾ cres 5662  suc csuc 6362  –1-1→wf1 6533  ‘cfv 6536  (class class class)co 7412  ωcom 7860  reccrdg 8394   ↑_m cmap 8822

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-om 7861  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395

This theorem is used by: (None)