fin1a2lem11 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > fin1a2lem11		Structured version Visualization version GIF version

Theorem fin1a2lem11 10407

Description: Lemma for fin1a2 10412. (Contributed by Stefan O'Rear, 8-Nov-2014.)

**Assertion**
Ref	Expression
fin1a2lem11	⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → ran (𝑏 ∈ ω ↦ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}) = (𝐴 ∪ {∅}))

Distinct variable group: 𝑏,𝑐,𝐴

Proof of Theorem fin1a2lem11 Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2732	. . 3 ⊢ (𝑏 ∈ ω ↦ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}) = (𝑏 ∈ ω ↦ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏})
2	1	rnmpt 5954	. 2 ⊢ ran (𝑏 ∈ ω ↦ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}) = {𝑑 ∣ ∃𝑏 ∈ ω 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}}
3		unieq 4919	. . . . . . . . . . . 12 ⊢ ({𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = ∅ → ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = ∪ ∅)
4		uni0 4939	. . . . . . . . . . . 12 ⊢ ∪ ∅ = ∅
5	3, 4	eqtrdi 2788	. . . . . . . . . . 11 ⊢ ({𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = ∅ → ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = ∅)
6	5	adantl 482	. . . . . . . . . 10 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑏 ∈ ω) ∧ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = ∅) → ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = ∅)
7		0ex 5307	. . . . . . . . . . 11 ⊢ ∅ ∈ V
8	7	elsn2 4667	. . . . . . . . . 10 ⊢ (∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ {∅} ↔ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = ∅)
9	6, 8	sylibr 233	. . . . . . . . 9 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑏 ∈ ω) ∧ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = ∅) → ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ {∅})
10	9	olcd 872	. . . . . . . 8 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑏 ∈ ω) ∧ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = ∅) → (∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ 𝐴 ∨ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ {∅}))
11		ssrab2 4077	. . . . . . . . . 10 ⊢ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ⊆ 𝐴
12		simpr 485	. . . . . . . . . . 11 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑏 ∈ ω) ∧ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ≠ ∅) → {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ≠ ∅)
13		fin1a2lem9 10405	. . . . . . . . . . . 12 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin ∧ 𝑏 ∈ ω) → {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ Fin)
14	13	ad4ant123 1172	. . . . . . . . . . 11 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑏 ∈ ω) ∧ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ≠ ∅) → {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ Fin)
15		simplll 773	. . . . . . . . . . . 12 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑏 ∈ ω) ∧ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ≠ ∅) → [⊊] Or 𝐴)
16		soss 5608	. . . . . . . . . . . 12 ⊢ ({𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ⊆ 𝐴 → ( [⊊] Or 𝐴 → [⊊] Or {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}))
17	11, 15, 16	mpsyl 68	. . . . . . . . . . 11 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑏 ∈ ω) ∧ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ≠ ∅) → [⊊] Or {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏})
18		fin1a2lem10 10406	. . . . . . . . . . 11 ⊢ (({𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ≠ ∅ ∧ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ Fin ∧ [⊊] Or {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}) → ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏})
19	12, 14, 17, 18	syl3anc 1371	. . . . . . . . . 10 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑏 ∈ ω) ∧ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ≠ ∅) → ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏})
20	11, 19	sselid 3980	. . . . . . . . 9 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑏 ∈ ω) ∧ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ≠ ∅) → ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ 𝐴)
21	20	orcd 871	. . . . . . . 8 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑏 ∈ ω) ∧ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ≠ ∅) → (∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ 𝐴 ∨ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ {∅}))
22	10, 21	pm2.61dane 3029	. . . . . . 7 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑏 ∈ ω) → (∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ 𝐴 ∨ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ {∅}))
23		eleq1 2821	. . . . . . . 8 ⊢ (𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} → (𝑑 ∈ 𝐴 ↔ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ 𝐴))
24		eleq1 2821	. . . . . . . 8 ⊢ (𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} → (𝑑 ∈ {∅} ↔ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ {∅}))
25	23, 24	orbi12d 917	. . . . . . 7 ⊢ (𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} → ((𝑑 ∈ 𝐴 ∨ 𝑑 ∈ {∅}) ↔ (∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ 𝐴 ∨ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ∈ {∅})))
26	22, 25	syl5ibrcom 246	. . . . . 6 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑏 ∈ ω) → (𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} → (𝑑 ∈ 𝐴 ∨ 𝑑 ∈ {∅})))
27	26	rexlimdva 3155	. . . . 5 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → (∃𝑏 ∈ ω 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} → (𝑑 ∈ 𝐴 ∨ 𝑑 ∈ {∅})))
28		simpr 485	. . . . . . . . . 10 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → 𝐴 ⊆ Fin)
29	28	sselda 3982	. . . . . . . . 9 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → 𝑑 ∈ Fin)
30		ficardom 9958	. . . . . . . . 9 ⊢ (𝑑 ∈ Fin → (card‘𝑑) ∈ ω)
31	29, 30	syl 17	. . . . . . . 8 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → (card‘𝑑) ∈ ω)
32		breq1 5151	. . . . . . . . . . 11 ⊢ (𝑐 = 𝑑 → (𝑐 ≼ (card‘𝑑) ↔ 𝑑 ≼ (card‘𝑑)))
33		simpr 485	. . . . . . . . . . 11 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → 𝑑 ∈ 𝐴)
34		ficardid 9959	. . . . . . . . . . . . 13 ⊢ (𝑑 ∈ Fin → (card‘𝑑) ≈ 𝑑)
35	29, 34	syl 17	. . . . . . . . . . . 12 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → (card‘𝑑) ≈ 𝑑)
36		ensym 9001	. . . . . . . . . . . 12 ⊢ ((card‘𝑑) ≈ 𝑑 → 𝑑 ≈ (card‘𝑑))
37		endom 8977	. . . . . . . . . . . 12 ⊢ (𝑑 ≈ (card‘𝑑) → 𝑑 ≼ (card‘𝑑))
38	35, 36, 37	3syl 18	. . . . . . . . . . 11 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → 𝑑 ≼ (card‘𝑑))
39	32, 33, 38	elrabd 3685	. . . . . . . . . 10 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → 𝑑 ∈ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)})
40		elssuni 4941	. . . . . . . . . 10 ⊢ (𝑑 ∈ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)} → 𝑑 ⊆ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)})
41	39, 40	syl 17	. . . . . . . . 9 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → 𝑑 ⊆ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)})
42		breq1 5151	. . . . . . . . . . . . 13 ⊢ (𝑐 = 𝑏 → (𝑐 ≼ (card‘𝑑) ↔ 𝑏 ≼ (card‘𝑑)))
43	42	elrab 3683	. . . . . . . . . . . 12 ⊢ (𝑏 ∈ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)} ↔ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑)))
44		simprr 771	. . . . . . . . . . . . . . 15 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) ∧ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑))) → 𝑏 ≼ (card‘𝑑))
45	35	adantr 481	. . . . . . . . . . . . . . 15 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) ∧ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑))) → (card‘𝑑) ≈ 𝑑)
46		domentr 9011	. . . . . . . . . . . . . . 15 ⊢ ((𝑏 ≼ (card‘𝑑) ∧ (card‘𝑑) ≈ 𝑑) → 𝑏 ≼ 𝑑)
47	44, 45, 46	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) ∧ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑))) → 𝑏 ≼ 𝑑)
48		simpllr 774	. . . . . . . . . . . . . . . 16 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) ∧ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑))) → 𝐴 ⊆ Fin)
49		simprl 769	. . . . . . . . . . . . . . . 16 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) ∧ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑))) → 𝑏 ∈ 𝐴)
50	48, 49	sseldd 3983	. . . . . . . . . . . . . . 15 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) ∧ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑))) → 𝑏 ∈ Fin)
51	29	adantr 481	. . . . . . . . . . . . . . 15 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) ∧ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑))) → 𝑑 ∈ Fin)
52		simplll 773	. . . . . . . . . . . . . . . 16 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) ∧ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑))) → [⊊] Or 𝐴)
53		simplr 767	. . . . . . . . . . . . . . . 16 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) ∧ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑))) → 𝑑 ∈ 𝐴)
54		sorpssi 7721	. . . . . . . . . . . . . . . 16 ⊢ (( [⊊] Or 𝐴 ∧ (𝑏 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴)) → (𝑏 ⊆ 𝑑 ∨ 𝑑 ⊆ 𝑏))
55	52, 49, 53, 54	syl12anc 835	. . . . . . . . . . . . . . 15 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) ∧ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑))) → (𝑏 ⊆ 𝑑 ∨ 𝑑 ⊆ 𝑏))
56		fincssdom 10320	. . . . . . . . . . . . . . 15 ⊢ ((𝑏 ∈ Fin ∧ 𝑑 ∈ Fin ∧ (𝑏 ⊆ 𝑑 ∨ 𝑑 ⊆ 𝑏)) → (𝑏 ≼ 𝑑 ↔ 𝑏 ⊆ 𝑑))
57	50, 51, 55, 56	syl3anc 1371	. . . . . . . . . . . . . 14 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) ∧ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑))) → (𝑏 ≼ 𝑑 ↔ 𝑏 ⊆ 𝑑))
58	47, 57	mpbid 231	. . . . . . . . . . . . 13 ⊢ (((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) ∧ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑))) → 𝑏 ⊆ 𝑑)
59	58	ex 413	. . . . . . . . . . . 12 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → ((𝑏 ∈ 𝐴 ∧ 𝑏 ≼ (card‘𝑑)) → 𝑏 ⊆ 𝑑))
60	43, 59	biimtrid 241	. . . . . . . . . . 11 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → (𝑏 ∈ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)} → 𝑏 ⊆ 𝑑))
61	60	ralrimiv 3145	. . . . . . . . . 10 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → ∀𝑏 ∈ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)}𝑏 ⊆ 𝑑)
62		unissb 4943	. . . . . . . . . 10 ⊢ (∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)} ⊆ 𝑑 ↔ ∀𝑏 ∈ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)}𝑏 ⊆ 𝑑)
63	61, 62	sylibr 233	. . . . . . . . 9 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)} ⊆ 𝑑)
64	41, 63	eqssd 3999	. . . . . . . 8 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)})
65		breq2 5152	. . . . . . . . . . 11 ⊢ (𝑏 = (card‘𝑑) → (𝑐 ≼ 𝑏 ↔ 𝑐 ≼ (card‘𝑑)))
66	65	rabbidv 3440	. . . . . . . . . 10 ⊢ (𝑏 = (card‘𝑑) → {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)})
67	66	unieqd 4922	. . . . . . . . 9 ⊢ (𝑏 = (card‘𝑑) → ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)})
68	67	rspceeqv 3633	. . . . . . . 8 ⊢ (((card‘𝑑) ∈ ω ∧ 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ (card‘𝑑)}) → ∃𝑏 ∈ ω 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏})
69	31, 64, 68	syl2anc 584	. . . . . . 7 ⊢ ((( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) ∧ 𝑑 ∈ 𝐴) → ∃𝑏 ∈ ω 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏})
70	69	ex 413	. . . . . 6 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → (𝑑 ∈ 𝐴 → ∃𝑏 ∈ ω 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}))
71		velsn 4644	. . . . . . 7 ⊢ (𝑑 ∈ {∅} ↔ 𝑑 = ∅)
72		peano1 7881	. . . . . . . . 9 ⊢ ∅ ∈ ω
73		dom0 9104	. . . . . . . . . . . . . . . 16 ⊢ (𝑏 ≼ ∅ ↔ 𝑏 = ∅)
74	73	biimpi 215	. . . . . . . . . . . . . . 15 ⊢ (𝑏 ≼ ∅ → 𝑏 = ∅)
75	74	adantl 482	. . . . . . . . . . . . . 14 ⊢ ((𝑏 ∈ 𝐴 ∧ 𝑏 ≼ ∅) → 𝑏 = ∅)
76	75	a1i 11	. . . . . . . . . . . . 13 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → ((𝑏 ∈ 𝐴 ∧ 𝑏 ≼ ∅) → 𝑏 = ∅))
77		breq1 5151	. . . . . . . . . . . . . 14 ⊢ (𝑐 = 𝑏 → (𝑐 ≼ ∅ ↔ 𝑏 ≼ ∅))
78	77	elrab 3683	. . . . . . . . . . . . 13 ⊢ (𝑏 ∈ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ ∅} ↔ (𝑏 ∈ 𝐴 ∧ 𝑏 ≼ ∅))
79		velsn 4644	. . . . . . . . . . . . 13 ⊢ (𝑏 ∈ {∅} ↔ 𝑏 = ∅)
80	76, 78, 79	3imtr4g 295	. . . . . . . . . . . 12 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → (𝑏 ∈ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ ∅} → 𝑏 ∈ {∅}))
81	80	ssrdv 3988	. . . . . . . . . . 11 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ ∅} ⊆ {∅})
82		uni0b 4937	. . . . . . . . . . 11 ⊢ (∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ ∅} = ∅ ↔ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ ∅} ⊆ {∅})
83	81, 82	sylibr 233	. . . . . . . . . 10 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ ∅} = ∅)
84	83	eqcomd 2738	. . . . . . . . 9 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → ∅ = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ ∅})
85		breq2 5152	. . . . . . . . . . . 12 ⊢ (𝑏 = ∅ → (𝑐 ≼ 𝑏 ↔ 𝑐 ≼ ∅))
86	85	rabbidv 3440	. . . . . . . . . . 11 ⊢ (𝑏 = ∅ → {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ ∅})
87	86	unieqd 4922	. . . . . . . . . 10 ⊢ (𝑏 = ∅ → ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ ∅})
88	87	rspceeqv 3633	. . . . . . . . 9 ⊢ ((∅ ∈ ω ∧ ∅ = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ ∅}) → ∃𝑏 ∈ ω ∅ = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏})
89	72, 84, 88	sylancr 587	. . . . . . . 8 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → ∃𝑏 ∈ ω ∅ = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏})
90		eqeq1 2736	. . . . . . . . 9 ⊢ (𝑑 = ∅ → (𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ↔ ∅ = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}))
91	90	rexbidv 3178	. . . . . . . 8 ⊢ (𝑑 = ∅ → (∃𝑏 ∈ ω 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ↔ ∃𝑏 ∈ ω ∅ = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}))
92	89, 91	syl5ibrcom 246	. . . . . . 7 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → (𝑑 = ∅ → ∃𝑏 ∈ ω 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}))
93	71, 92	biimtrid 241	. . . . . 6 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → (𝑑 ∈ {∅} → ∃𝑏 ∈ ω 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}))
94	70, 93	jaod 857	. . . . 5 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → ((𝑑 ∈ 𝐴 ∨ 𝑑 ∈ {∅}) → ∃𝑏 ∈ ω 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}))
95	27, 94	impbid 211	. . . 4 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → (∃𝑏 ∈ ω 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ↔ (𝑑 ∈ 𝐴 ∨ 𝑑 ∈ {∅})))
96		elun 4148	. . . 4 ⊢ (𝑑 ∈ (𝐴 ∪ {∅}) ↔ (𝑑 ∈ 𝐴 ∨ 𝑑 ∈ {∅}))
97	95, 96	bitr4di 288	. . 3 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → (∃𝑏 ∈ ω 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏} ↔ 𝑑 ∈ (𝐴 ∪ {∅})))
98	97	eqabcdv 2868	. 2 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → {𝑑 ∣ ∃𝑏 ∈ ω 𝑑 = ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}} = (𝐴 ∪ {∅}))
99	2, 98	eqtrid 2784	1 ⊢ (( [⊊] Or 𝐴 ∧ 𝐴 ⊆ Fin) → ran (𝑏 ∈ ω ↦ ∪ {𝑐 ∈ 𝐴 ∣ 𝑐 ≼ 𝑏}) = (𝐴 ∪ {∅}))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 845 = wceq 1541 ∈ wcel 2106 {cab 2709 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 {crab 3432 ∪ cun 3946 ⊆ wss 3948 ∅c0 4322 {csn 4628 ∪ cuni 4908 class class class wbr 5148 ↦ cmpt 5231 Or wor 5587 ran crn 5677 ‘cfv 6543 [⊊] crpss 7714 ωcom 7857 ≈ cen 8938 ≼ cdom 8939 Fincfn 8941 cardccrd 9932

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-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 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-int 4951 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-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-rpss 7715 df-om 7858 df-1o 8468 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-card 9936

This theorem is referenced by: fin1a2lem12 10408

W3C validator