Theorem fin23lem36 9170

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

Hypotheses

Ref	Expression
fin23lem33.f	⊢ 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑𝑚 ω)(∀𝑥 ∈ ω (𝑎‘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 6191	. . . . . . 7 ⊢ (𝑎 = 𝐵 → (𝑌‘𝑎) = (𝑌‘𝐵))
2	1	rneqd 5353	. . . . . 6 ⊢ (𝑎 = 𝐵 → ran (𝑌‘𝑎) = ran (𝑌‘𝐵))
3	2	unieqd 4446	. . . . 5 ⊢ (𝑎 = 𝐵 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘𝐵))
4	3	sseq1d 3632	. . . 4 ⊢ (𝑎 = 𝐵 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵)))
5	4	imbi2d 330	. . 3 ⊢ (𝑎 = 𝐵 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵))))
6		fveq2 6191	. . . . . . 7 ⊢ (𝑎 = 𝑏 → (𝑌‘𝑎) = (𝑌‘𝑏))
7	6	rneqd 5353	. . . . . 6 ⊢ (𝑎 = 𝑏 → ran (𝑌‘𝑎) = ran (𝑌‘𝑏))
8	7	unieqd 4446	. . . . 5 ⊢ (𝑎 = 𝑏 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘𝑏))
9	8	sseq1d 3632	. . . 4 ⊢ (𝑎 = 𝑏 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
10	9	imbi2d 330	. . 3 ⊢ (𝑎 = 𝑏 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
11		fveq2 6191	. . . . . . 7 ⊢ (𝑎 = suc 𝑏 → (𝑌‘𝑎) = (𝑌‘suc 𝑏))
12	11	rneqd 5353	. . . . . 6 ⊢ (𝑎 = suc 𝑏 → ran (𝑌‘𝑎) = ran (𝑌‘suc 𝑏))
13	12	unieqd 4446	. . . . 5 ⊢ (𝑎 = suc 𝑏 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘suc 𝑏))
14	13	sseq1d 3632	. . . 4 ⊢ (𝑎 = suc 𝑏 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
15	14	imbi2d 330	. . 3 ⊢ (𝑎 = suc 𝑏 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
16		fveq2 6191	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (𝑌‘𝑎) = (𝑌‘𝐴))
17	16	rneqd 5353	. . . . . 6 ⊢ (𝑎 = 𝐴 → ran (𝑌‘𝑎) = ran (𝑌‘𝐴))
18	17	unieqd 4446	. . . . 5 ⊢ (𝑎 = 𝐴 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘𝐴))
19	18	sseq1d 3632	. . . 4 ⊢ (𝑎 = 𝐴 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵)))
20	19	imbi2d 330	. . 3 ⊢ (𝑎 = 𝐴 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵))))
21		ssid 3624	. . . 4 ⊢ ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵)
22	21	2a1i 12	. . 3 ⊢ (𝐵 ∈ ω → (𝜑 → ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵)))
23		simprr 796	. . . . . . . 8 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → 𝜑)
24		simpll 790	. . . . . . . 8 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → 𝑏 ∈ ω)
25		fin23lem33.f	. . . . . . . . 9 ⊢ 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑𝑚 ω)(∀𝑥 ∈ ω (𝑎‘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 9169	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ ω) → ∪ ran (𝑌‘suc 𝑏) ⊊ ∪ ran (𝑌‘𝑏))
31	23, 24, 30	syl2anc 693	. . . . . . 7 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → ∪ ran (𝑌‘suc 𝑏) ⊊ ∪ ran (𝑌‘𝑏))
32	31	pssssd 3704	. . . . . 6 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝑏))
33		sstr2 3610	. . . . . 6 ⊢ (∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝑏) → (∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
34	32, 33	syl 17	. . . . 5 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → (∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
35	34	expr 643	. . . 4 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐵 ⊆ 𝑏) → (𝜑 → (∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
36	35	a2d 29	. . 3 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐵 ⊆ 𝑏) → ((𝜑 → ∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵)) → (𝜑 → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
37	5, 10, 15, 20, 22, 36	findsg 7093	. 2 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐵 ⊆ 𝐴) → (𝜑 → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵)))
38	37	impr 649	1 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝐴 ∧ 𝜑)) → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵))

Syntax hints:   → wi 4   ∧ wa 384  ∀wal 1481   = wceq 1483   ∈ wcel 1990  {cab 2608  ∀wral 2912  Vcvv 3200   ⊆ wss 3574   ⊊ wpss 3575  𝒫 cpw 4158  ∪ cuni 4436  ∩ cint 4475  ran crn 5115   ↾ cres 5116  suc csuc 5725  –1-1→wf1 5885  ‘cfv 5888  (class class class)co 6650  ωcom 7065  reccrdg 7505   ↑_𝑚 cmap 7857

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-om 7066  df-wrecs 7407  df-recs 7468  df-rdg 7506

This theorem is referenced by: (None)