Theorem fin23lem36 10450

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

Hypotheses

Ref	Expression
fin23lem33.f	⊢ 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) → ∩ ran 𝑎 ∈ ran 𝑎)}
fin23lem.f	⊢ (𝜑 → ℎ:ω⟶1-1V)
fin23lem.g	⊢ (𝜑 → ∪ ran ℎ ⊆ 𝐺)
fin23lem.h	⊢ (𝜑 → ∀𝑗((𝑗:ω⟶1-1V ∧ ∪ ran 𝑗 ⊆ 𝐺) → ((𝑖‘𝑗):ω⟶1-1V ∧ ∪ 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 6905	. . . . . . 7 ⊢ (𝑎 = 𝐵 → (𝑌‘𝑎) = (𝑌‘𝐵))
2	1	rneqd 5926	. . . . . 6 ⊢ (𝑎 = 𝐵 → ran (𝑌‘𝑎) = ran (𝑌‘𝐵))
3	2	unieqd 4883	. . . . 5 ⊢ (𝑎 = 𝐵 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘𝐵))
4	3	sseq1d 3944	. . . 4 ⊢ (𝑎 = 𝐵 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵)))
5	4	imbi2d 343	. . 3 ⊢ (𝑎 = 𝐵 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵))))
6		fveq2 6905	. . . . . . 7 ⊢ (𝑎 = 𝑏 → (𝑌‘𝑎) = (𝑌‘𝑏))
7	6	rneqd 5926	. . . . . 6 ⊢ (𝑎 = 𝑏 → ran (𝑌‘𝑎) = ran (𝑌‘𝑏))
8	7	unieqd 4883	. . . . 5 ⊢ (𝑎 = 𝑏 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘𝑏))
9	8	sseq1d 3944	. . . 4 ⊢ (𝑎 = 𝑏 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
10	9	imbi2d 343	. . 3 ⊢ (𝑎 = 𝑏 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
11		fveq2 6905	. . . . . . 7 ⊢ (𝑎 = suc 𝑏 → (𝑌‘𝑎) = (𝑌‘suc 𝑏))
12	11	rneqd 5926	. . . . . 6 ⊢ (𝑎 = suc 𝑏 → ran (𝑌‘𝑎) = ran (𝑌‘suc 𝑏))
13	12	unieqd 4883	. . . . 5 ⊢ (𝑎 = suc 𝑏 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘suc 𝑏))
14	13	sseq1d 3944	. . . 4 ⊢ (𝑎 = suc 𝑏 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
15	14	imbi2d 343	. . 3 ⊢ (𝑎 = suc 𝑏 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
16		fveq2 6905	. . . . . . 7 ⊢ (𝑎 = 𝐴 → (𝑌‘𝑎) = (𝑌‘𝐴))
17	16	rneqd 5926	. . . . . 6 ⊢ (𝑎 = 𝐴 → ran (𝑌‘𝑎) = ran (𝑌‘𝐴))
18	17	unieqd 4883	. . . . 5 ⊢ (𝑎 = 𝐴 → ∪ ran (𝑌‘𝑎) = ∪ ran (𝑌‘𝐴))
19	18	sseq1d 3944	. . . 4 ⊢ (𝑎 = 𝐴 → (∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵) ↔ ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵)))
20	19	imbi2d 343	. . 3 ⊢ (𝑎 = 𝐴 → ((𝜑 → ∪ ran (𝑌‘𝑎) ⊆ ∪ ran (𝑌‘𝐵)) ↔ (𝜑 → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵))))
21		ssid 3935	. . . 4 ⊢ ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵)
22	21	2a1i 12	. . 3 ⊢ (𝐵 ∈ ω → (𝜑 → ∪ ran (𝑌‘𝐵) ⊆ ∪ ran (𝑌‘𝐵)))
23		simprr 785	. . . . . . . 8 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → 𝜑)
24		simpll 779	. . . . . . . 8 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → 𝑏 ∈ ω)
25		fin23lem33.f	. . . . . . . . 9 ⊢ 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) → ∩ ran 𝑎 ∈ ran 𝑎)}
26		fin23lem.f	. . . . . . . . 9 ⊢ (𝜑 → ℎ:ω⟶1-1V)
27		fin23lem.g	. . . . . . . . 9 ⊢ (𝜑 → ∪ ran ℎ ⊆ 𝐺)
28		fin23lem.h	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑗((𝑗:ω⟶1-1V ∧ ∪ ran 𝑗 ⊆ 𝐺) → ((𝑖‘𝑗):ω⟶1-1V ∧ ∪ ran (𝑖‘𝑗) ⊊ ∪ ran 𝑗)))
29		fin23lem.i	. . . . . . . . 9 ⊢ 𝑌 = (rec(𝑖, ℎ) ↾ ω)
30	25, 26, 27, 28, 29	fin23lem35 10449	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑏 ∈ ω) → ∪ ran (𝑌‘suc 𝑏) ⊊ ∪ ran (𝑌‘𝑏))
31	23, 24, 30	syl2anc 596	. . . . . . 7 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → ∪ ran (𝑌‘suc 𝑏) ⊊ ∪ ran (𝑌‘𝑏))
32	31	pssssd 4030	. . . . . 6 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝑏))
33		sstr2 3920	. . . . . 6 ⊢ (∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝑏) → (∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
34	32, 33	syl 18	. . . . 5 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝑏 ∧ 𝜑)) → (∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵)))
35	34	expr 462	. . . 4 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐵 ⊆ 𝑏) → (𝜑 → (∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵) → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
36	35	a2d 30	. . 3 ⊢ (((𝑏 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐵 ⊆ 𝑏) → ((𝜑 → ∪ ran (𝑌‘𝑏) ⊆ ∪ ran (𝑌‘𝐵)) → (𝜑 → ∪ ran (𝑌‘suc 𝑏) ⊆ ∪ ran (𝑌‘𝐵))))
37	5, 10, 15, 20, 22, 36	findsg 7930	. 2 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐵 ⊆ 𝐴) → (𝜑 → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵)))
38	37	impr 460	1 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ (𝐵 ⊆ 𝐴 ∧ 𝜑)) → ∪ ran (𝑌‘𝐴) ⊆ ∪ ran (𝑌‘𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2147  {cab 2741  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   ⊊ wpss 4016  𝒫 cpw 4560  ∪ cuni 4870  ∩ cint 4910  ran crn 5656   ↾ cres 5657  suc csuc 6379  ⟶1-1wf1 6552  ‘cfv 6555  (class class class)co 7440  ωcom 7898  reccrdg 8442   ↑_m cmap 8872

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7772

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 2102  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-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 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-om 7899  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443

This theorem is used by: (None)