Theorem fin23lem36 10345

Description: Lemma for fin23 10386. 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 6891	. . . . . . 7 ⊢ (𝑎 = 𝐵 → (𝑌‘𝑎) = (𝑌‘𝐵))
2	1	rneqd 5937	. . . . . 6 ⊢ (𝑎 = 𝐵 → ran (𝑌‘𝑎) = ran (𝑌‘𝐵))
3	2	unieqd 4922	. . . . 5 ⊢ (𝑎 = 𝐵 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘𝐵))
4	3	sseq1d 4013	. . . 4 ⊢ (𝑎 = 𝐵 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵)))
5	4	imbi2d 340	. . 3 ⊢ (𝑎 = 𝐵 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵))))
6		fveq2 6891	. . . . . . 7 ⊢ (𝑎 = 𝑏 → (𝑌‘𝑎) = (𝑌‘𝑏))
7	6	rneqd 5937	. . . . . 6 ⊢ (𝑎 = 𝑏 → ran (𝑌‘𝑎) = ran (𝑌‘𝑏))
8	7	unieqd 4922	. . . . 5 ⊢ (𝑎 = 𝑏 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘𝑏))
9	8	sseq1d 4013	. . . 4 ⊢ (𝑎 = 𝑏 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
10	9	imbi2d 340	. . 3 ⊢ (𝑎 = 𝑏 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
11		fveq2 6891	. . . . . . 7 ⊢ (𝑎 = suc 𝑏 → (𝑌‘𝑎) = (𝑌‘suc 𝑏))
12	11	rneqd 5937	. . . . . 6 ⊢ (𝑎 = suc 𝑏 → ran (𝑌‘𝑎) = ran (𝑌‘suc 𝑏))
13	12	unieqd 4922	. . . . 5 ⊢ (𝑎 = suc 𝑏 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘suc 𝑏))
14	13	sseq1d 4013	. . . 4 ⊢ (𝑎 = suc 𝑏 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
15	14	imbi2d 340	. . 3 ⊢ (𝑎 = suc 𝑏 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
16		fveq2 6891	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (𝑌‘𝑎) = (𝑌‘𝐴))
17	16	rneqd 5937	. . . . . 6 ⊢ (𝑎 = 𝐴 → ran (𝑌‘𝑎) = ran (𝑌‘𝐴))
18	17	unieqd 4922	. . . . 5 ⊢ (𝑎 = 𝐴 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘𝐴))
19	18	sseq1d 4013	. . . 4 ⊢ (𝑎 = 𝐴 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵)))
20	19	imbi2d 340	. . 3 ⊢ (𝑎 = 𝐴 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵))))
21		ssid 4004	. . . 4 ⊢ ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵)
22	21	2a1i 12	. . 3 ⊢ (𝐵 ∈ ω → (𝜑 → ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵)))
23		simprr 771	. . . . . . . 8 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → 𝜑)
24		simpll 765	. . . . . . . 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 10344	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ ω) → ∪ ran (𝑌‘suc 𝑏) ⊊ ∪ ran (𝑌‘𝑏))
31	23, 24, 30	syl2anc 584	. . . . . . 7 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → ∪ ran (𝑌‘suc 𝑏) ⊊ ∪ ran (𝑌‘𝑏))
32	31	pssssd 4097	. . . . . 6 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝑏))
33		sstr2 3989	. . . . . 6 ⊢ (∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝑏) → (∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
34	32, 33	syl 17	. . . . 5 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → (∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
35	34	expr 457	. . . 4 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐵 ⊆ 𝑏) → (𝜑 → (∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
36	35	a2d 29	. . 3 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐵 ⊆ 𝑏) → ((𝜑 → ∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵)) → (𝜑 → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
37	5, 10, 15, 20, 22, 36	findsg 7892	. 2 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐵 ⊆ 𝐴) → (𝜑 → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵)))
38	37	impr 455	1 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝐴 ∧ 𝜑)) → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵))

Syntax hints:   → wi 4   ∧ wa 396  ∀wal 1539   = wceq 1541   ∈ wcel 2106  {cab 2709  ∀wral 3061  Vcvv 3474   ⊆ wss 3948   ⊊ wpss 3949  𝒫 cpw 4602  ∪ cuni 4908  ∩ cint 4950  ran crn 5677   ↾ cres 5678  suc csuc 6366  –1-1→wf1 6540  ‘cfv 6543  (class class class)co 7411  ωcom 7857  reccrdg 8411   ↑_m cmap 8822

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-un 7727

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7414  df-om 7858  df-2nd 7978  df-frecs 8268  df-wrecs 8299  df-recs 8373  df-rdg 8412

This theorem is referenced by: (None)