difinfsn - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > difinfsn		GIF version

Theorem difinfsn 7159

Description: An infinite set minus one element is infinite. We require that the set has decidable equality. (Contributed by Jim Kingdon, 8-Aug-2023.)

**Assertion**
Ref	Expression
difinfsn	⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) → ω ≼ (𝐴 ∖ {𝐵}))

Distinct variable groups: 𝑥,𝐴,𝑦 𝑥,𝐵,𝑦

Proof of Theorem difinfsn Dummy variables 𝑎 𝑓 𝑔 𝑛 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		omp1eom 7154	. . . . 5 ⊢ (ω ⊔ 1_o) ≈ ω
2		simp2 1000	. . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) → ω ≼ 𝐴)
3		endomtr 6844	. . . . 5 ⊢ (((ω ⊔ 1_o) ≈ ω ∧ ω ≼ 𝐴) → (ω ⊔ 1_o) ≼ 𝐴)
4	1, 2, 3	sylancr 414	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) → (ω ⊔ 1_o) ≼ 𝐴)
5		brdomi 6803	. . . 4 ⊢ ((ω ⊔ 1_o) ≼ 𝐴 → ∃𝑓 𝑓:(ω ⊔ 1_o)–1-1→𝐴)
6	4, 5	syl 14	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃𝑓 𝑓:(ω ⊔ 1_o)–1-1→𝐴)
7		inlresf1 7120	. . . . . . . 8 ⊢ (inl ↾ ω):ω–1-1→(ω ⊔ 1_o)
8		f1co 5471	. . . . . . . 8 ⊢ ((𝑓:(ω ⊔ 1_o)–1-1→𝐴 ∧ (inl ↾ ω):ω–1-1→(ω ⊔ 1_o)) → (𝑓 ∘ (inl ↾ ω)):ω–1-1→𝐴)
9	7, 8	mpan2 425	. . . . . . 7 ⊢ (𝑓:(ω ⊔ 1_o)–1-1→𝐴 → (𝑓 ∘ (inl ↾ ω)):ω–1-1→𝐴)
10	9	ad2antlr 489	. . . . . 6 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) → (𝑓 ∘ (inl ↾ ω)):ω–1-1→𝐴)
11		f1f 5459	. . . . . . . . . . . 12 ⊢ ((𝑓 ∘ (inl ↾ ω)):ω–1-1→𝐴 → (𝑓 ∘ (inl ↾ ω)):ω⟶𝐴)
12	10, 11	syl 14	. . . . . . . . . . 11 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) → (𝑓 ∘ (inl ↾ ω)):ω⟶𝐴)
13	12	frnd 5413	. . . . . . . . . 10 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) → ran (𝑓 ∘ (inl ↾ ω)) ⊆ 𝐴)
14	13	sselda 3179	. . . . . . . . 9 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑠 ∈ ran (𝑓 ∘ (inl ↾ ω))) → 𝑠 ∈ 𝐴)
15		simpllr 534	. . . . . . . . . . . . . . . 16 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) ∧ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵) → (𝑓‘(inr‘∅)) = 𝐵)
16		simpr 110	. . . . . . . . . . . . . . . 16 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) ∧ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵) → ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵)
17		f1f 5459	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((inl ↾ ω):ω–1-1→(ω ⊔ 1_o) → (inl ↾ ω):ω⟶(ω ⊔ 1_o))
18	7, 17	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ (inl ↾ ω):ω⟶(ω ⊔ 1_o)
19		simpr 110	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) → 𝑛 ∈ ω)
20		fvco3 5628	. . . . . . . . . . . . . . . . . . 19 ⊢ (((inl ↾ ω):ω⟶(ω ⊔ 1_o) ∧ 𝑛 ∈ ω) → ((𝑓 ∘ (inl ↾ ω))‘𝑛) = (𝑓‘((inl ↾ ω)‘𝑛)))
21	18, 19, 20	sylancr 414	. . . . . . . . . . . . . . . . . 18 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) → ((𝑓 ∘ (inl ↾ ω))‘𝑛) = (𝑓‘((inl ↾ ω)‘𝑛)))
22	19	fvresd 5579	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) → ((inl ↾ ω)‘𝑛) = (inl‘𝑛))
23	22	fveq2d 5558	. . . . . . . . . . . . . . . . . 18 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) → (𝑓‘((inl ↾ ω)‘𝑛)) = (𝑓‘(inl‘𝑛)))
24	21, 23	eqtrd 2226	. . . . . . . . . . . . . . . . 17 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) → ((𝑓 ∘ (inl ↾ ω))‘𝑛) = (𝑓‘(inl‘𝑛)))
25	24	adantr 276	. . . . . . . . . . . . . . . 16 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) ∧ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵) → ((𝑓 ∘ (inl ↾ ω))‘𝑛) = (𝑓‘(inl‘𝑛)))
26	15, 16, 25	3eqtr2rd 2233	. . . . . . . . . . . . . . 15 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) ∧ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵) → (𝑓‘(inl‘𝑛)) = (𝑓‘(inr‘∅)))
27		simp-4r 542	. . . . . . . . . . . . . . . 16 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) ∧ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵) → 𝑓:(ω ⊔ 1_o)–1-1→𝐴)
28		djulcl 7110	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ ω → (inl‘𝑛) ∈ (ω ⊔ 1_o))
29	28	ad2antlr 489	. . . . . . . . . . . . . . . 16 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) ∧ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵) → (inl‘𝑛) ∈ (ω ⊔ 1_o))
30		0lt1o 6493	. . . . . . . . . . . . . . . . . 18 ⊢ ∅ ∈ 1_o
31		djurcl 7111	. . . . . . . . . . . . . . . . . 18 ⊢ (∅ ∈ 1_o → (inr‘∅) ∈ (ω ⊔ 1_o))
32	30, 31	ax-mp 5	. . . . . . . . . . . . . . . . 17 ⊢ (inr‘∅) ∈ (ω ⊔ 1_o)
33	32	a1i 9	. . . . . . . . . . . . . . . 16 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) ∧ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵) → (inr‘∅) ∈ (ω ⊔ 1_o))
34		f1veqaeq 5812	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:(ω ⊔ 1_o)–1-1→𝐴 ∧ ((inl‘𝑛) ∈ (ω ⊔ 1_o) ∧ (inr‘∅) ∈ (ω ⊔ 1_o))) → ((𝑓‘(inl‘𝑛)) = (𝑓‘(inr‘∅)) → (inl‘𝑛) = (inr‘∅)))
35	27, 29, 33, 34	syl12anc 1247	. . . . . . . . . . . . . . 15 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) ∧ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵) → ((𝑓‘(inl‘𝑛)) = (𝑓‘(inr‘∅)) → (inl‘𝑛) = (inr‘∅)))
36	26, 35	mpd 13	. . . . . . . . . . . . . 14 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) ∧ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵) → (inl‘𝑛) = (inr‘∅))
37	19	adantr 276	. . . . . . . . . . . . . . . 16 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) ∧ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵) → 𝑛 ∈ ω)
38		djune 7137	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ ω ∧ ∅ ∈ 1_o) → (inl‘𝑛) ≠ (inr‘∅))
39	37, 30, 38	sylancl 413	. . . . . . . . . . . . . . 15 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) ∧ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵) → (inl‘𝑛) ≠ (inr‘∅))
40	39	neneqd 2385	. . . . . . . . . . . . . 14 ⊢ ((((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) ∧ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵) → ¬ (inl‘𝑛) = (inr‘∅))
41	36, 40	pm2.65da 662	. . . . . . . . . . . . 13 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑛 ∈ ω) → ¬ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵)
42	41	ralrimiva 2567	. . . . . . . . . . . 12 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) → ∀𝑛 ∈ ω ¬ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵)
43	12	ffnd 5404	. . . . . . . . . . . . 13 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) → (𝑓 ∘ (inl ↾ ω)) Fn ω)
44		eqeq1 2200	. . . . . . . . . . . . . . 15 ⊢ (𝑠 = ((𝑓 ∘ (inl ↾ ω))‘𝑛) → (𝑠 = 𝐵 ↔ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵))
45	44	notbid 668	. . . . . . . . . . . . . 14 ⊢ (𝑠 = ((𝑓 ∘ (inl ↾ ω))‘𝑛) → (¬ 𝑠 = 𝐵 ↔ ¬ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵))
46	45	ralrn 5696	. . . . . . . . . . . . 13 ⊢ ((𝑓 ∘ (inl ↾ ω)) Fn ω → (∀𝑠 ∈ ran (𝑓 ∘ (inl ↾ ω)) ¬ 𝑠 = 𝐵 ↔ ∀𝑛 ∈ ω ¬ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵))
47	43, 46	syl 14	. . . . . . . . . . . 12 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) → (∀𝑠 ∈ ran (𝑓 ∘ (inl ↾ ω)) ¬ 𝑠 = 𝐵 ↔ ∀𝑛 ∈ ω ¬ ((𝑓 ∘ (inl ↾ ω))‘𝑛) = 𝐵))
48	42, 47	mpbird 167	. . . . . . . . . . 11 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) → ∀𝑠 ∈ ran (𝑓 ∘ (inl ↾ ω)) ¬ 𝑠 = 𝐵)
49	48	r19.21bi 2582	. . . . . . . . . 10 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑠 ∈ ran (𝑓 ∘ (inl ↾ ω))) → ¬ 𝑠 = 𝐵)
50		velsn 3635	. . . . . . . . . 10 ⊢ (𝑠 ∈ {𝐵} ↔ 𝑠 = 𝐵)
51	49, 50	sylnibr 678	. . . . . . . . 9 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑠 ∈ ran (𝑓 ∘ (inl ↾ ω))) → ¬ 𝑠 ∈ {𝐵})
52	14, 51	eldifd 3163	. . . . . . . 8 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) ∧ 𝑠 ∈ ran (𝑓 ∘ (inl ↾ ω))) → 𝑠 ∈ (𝐴 ∖ {𝐵}))
53	52	ex 115	. . . . . . 7 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) → (𝑠 ∈ ran (𝑓 ∘ (inl ↾ ω)) → 𝑠 ∈ (𝐴 ∖ {𝐵})))
54	53	ssrdv 3185	. . . . . 6 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) → ran (𝑓 ∘ (inl ↾ ω)) ⊆ (𝐴 ∖ {𝐵}))
55		f1ssr 5466	. . . . . 6 ⊢ (((𝑓 ∘ (inl ↾ ω)):ω–1-1→𝐴 ∧ ran (𝑓 ∘ (inl ↾ ω)) ⊆ (𝐴 ∖ {𝐵})) → (𝑓 ∘ (inl ↾ ω)):ω–1-1→(𝐴 ∖ {𝐵}))
56	10, 54, 55	syl2anc 411	. . . . 5 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) → (𝑓 ∘ (inl ↾ ω)):ω–1-1→(𝐴 ∖ {𝐵}))
57		f1f 5459	. . . . . . 7 ⊢ ((𝑓 ∘ (inl ↾ ω)):ω–1-1→(𝐴 ∖ {𝐵}) → (𝑓 ∘ (inl ↾ ω)):ω⟶(𝐴 ∖ {𝐵}))
58		omex 4625	. . . . . . 7 ⊢ ω ∈ V
59		fex 5787	. . . . . . 7 ⊢ (((𝑓 ∘ (inl ↾ ω)):ω⟶(𝐴 ∖ {𝐵}) ∧ ω ∈ V) → (𝑓 ∘ (inl ↾ ω)) ∈ V)
60	57, 58, 59	sylancl 413	. . . . . 6 ⊢ ((𝑓 ∘ (inl ↾ ω)):ω–1-1→(𝐴 ∖ {𝐵}) → (𝑓 ∘ (inl ↾ ω)) ∈ V)
61		f1eq1 5454	. . . . . . 7 ⊢ (𝑔 = (𝑓 ∘ (inl ↾ ω)) → (𝑔:ω–1-1→(𝐴 ∖ {𝐵}) ↔ (𝑓 ∘ (inl ↾ ω)):ω–1-1→(𝐴 ∖ {𝐵})))
62	61	spcegv 2848	. . . . . 6 ⊢ ((𝑓 ∘ (inl ↾ ω)) ∈ V → ((𝑓 ∘ (inl ↾ ω)):ω–1-1→(𝐴 ∖ {𝐵}) → ∃𝑔 𝑔:ω–1-1→(𝐴 ∖ {𝐵})))
63	60, 62	mpcom 36	. . . . 5 ⊢ ((𝑓 ∘ (inl ↾ ω)):ω–1-1→(𝐴 ∖ {𝐵}) → ∃𝑔 𝑔:ω–1-1→(𝐴 ∖ {𝐵}))
64	56, 63	syl 14	. . . 4 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ (𝑓‘(inr‘∅)) = 𝐵) → ∃𝑔 𝑔:ω–1-1→(𝐴 ∖ {𝐵}))
65		simpl1 1002	. . . . . . 7 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
66	65	adantr 276	. . . . . 6 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ ¬ (𝑓‘(inr‘∅)) = 𝐵) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
67		simpl3 1004	. . . . . . 7 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) → 𝐵 ∈ 𝐴)
68	67	adantr 276	. . . . . 6 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ ¬ (𝑓‘(inr‘∅)) = 𝐵) → 𝐵 ∈ 𝐴)
69		simpr 110	. . . . . . 7 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) → 𝑓:(ω ⊔ 1_o)–1-1→𝐴)
70	69	adantr 276	. . . . . 6 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ ¬ (𝑓‘(inr‘∅)) = 𝐵) → 𝑓:(ω ⊔ 1_o)–1-1→𝐴)
71		simpr 110	. . . . . . 7 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ ¬ (𝑓‘(inr‘∅)) = 𝐵) → ¬ (𝑓‘(inr‘∅)) = 𝐵)
72	71	neqned 2371	. . . . . 6 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ ¬ (𝑓‘(inr‘∅)) = 𝐵) → (𝑓‘(inr‘∅)) ≠ 𝐵)
73		eqid 2193	. . . . . 6 ⊢ (𝑎 ∈ ω ↦ if((𝑓‘(inl‘𝑎)) = 𝐵, (𝑓‘(inr‘∅)), (𝑓‘(inl‘𝑎)))) = (𝑎 ∈ ω ↦ if((𝑓‘(inl‘𝑎)) = 𝐵, (𝑓‘(inr‘∅)), (𝑓‘(inl‘𝑎))))
74	66, 68, 70, 72, 73	difinfsnlem 7158	. . . . 5 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ ¬ (𝑓‘(inr‘∅)) = 𝐵) → (𝑎 ∈ ω ↦ if((𝑓‘(inl‘𝑎)) = 𝐵, (𝑓‘(inr‘∅)), (𝑓‘(inl‘𝑎)))):ω–1-1→(𝐴 ∖ {𝐵}))
75	58	mptex 5784	. . . . . 6 ⊢ (𝑎 ∈ ω ↦ if((𝑓‘(inl‘𝑎)) = 𝐵, (𝑓‘(inr‘∅)), (𝑓‘(inl‘𝑎)))) ∈ V
76		f1eq1 5454	. . . . . 6 ⊢ (𝑔 = (𝑎 ∈ ω ↦ if((𝑓‘(inl‘𝑎)) = 𝐵, (𝑓‘(inr‘∅)), (𝑓‘(inl‘𝑎)))) → (𝑔:ω–1-1→(𝐴 ∖ {𝐵}) ↔ (𝑎 ∈ ω ↦ if((𝑓‘(inl‘𝑎)) = 𝐵, (𝑓‘(inr‘∅)), (𝑓‘(inl‘𝑎)))):ω–1-1→(𝐴 ∖ {𝐵})))
77	75, 76	spcev 2855	. . . . 5 ⊢ ((𝑎 ∈ ω ↦ if((𝑓‘(inl‘𝑎)) = 𝐵, (𝑓‘(inr‘∅)), (𝑓‘(inl‘𝑎)))):ω–1-1→(𝐴 ∖ {𝐵}) → ∃𝑔 𝑔:ω–1-1→(𝐴 ∖ {𝐵}))
78	74, 77	syl 14	. . . 4 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) ∧ ¬ (𝑓‘(inr‘∅)) = 𝐵) → ∃𝑔 𝑔:ω–1-1→(𝐴 ∖ {𝐵}))
79		f1f 5459	. . . . . . . . 9 ⊢ (𝑓:(ω ⊔ 1_o)–1-1→𝐴 → 𝑓:(ω ⊔ 1_o)⟶𝐴)
80	69, 79	syl 14	. . . . . . . 8 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) → 𝑓:(ω ⊔ 1_o)⟶𝐴)
81	32	a1i 9	. . . . . . . 8 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) → (inr‘∅) ∈ (ω ⊔ 1_o))
82	80, 81	ffvelcdmd 5694	. . . . . . 7 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) → (𝑓‘(inr‘∅)) ∈ 𝐴)
83	82, 67	jca 306	. . . . . 6 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) → ((𝑓‘(inr‘∅)) ∈ 𝐴 ∧ 𝐵 ∈ 𝐴))
84		eqeq12 2206	. . . . . . . 8 ⊢ ((𝑥 = (𝑓‘(inr‘∅)) ∧ 𝑦 = 𝐵) → (𝑥 = 𝑦 ↔ (𝑓‘(inr‘∅)) = 𝐵))
85	84	dcbid 839	. . . . . . 7 ⊢ ((𝑥 = (𝑓‘(inr‘∅)) ∧ 𝑦 = 𝐵) → (DECID 𝑥 = 𝑦 ↔ DECID (𝑓‘(inr‘∅)) = 𝐵))
86	85	rspc2gv 2876	. . . . . 6 ⊢ (((𝑓‘(inr‘∅)) ∈ 𝐴 ∧ 𝐵 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 → DECID (𝑓‘(inr‘∅)) = 𝐵))
87	83, 65, 86	sylc 62	. . . . 5 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) → DECID (𝑓‘(inr‘∅)) = 𝐵)
88		exmiddc 837	. . . . 5 ⊢ (DECID (𝑓‘(inr‘∅)) = 𝐵 → ((𝑓‘(inr‘∅)) = 𝐵 ∨ ¬ (𝑓‘(inr‘∅)) = 𝐵))
89	87, 88	syl 14	. . . 4 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) → ((𝑓‘(inr‘∅)) = 𝐵 ∨ ¬ (𝑓‘(inr‘∅)) = 𝐵))
90	64, 78, 89	mpjaodan 799	. . 3 ⊢ (((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:(ω ⊔ 1_o)–1-1→𝐴) → ∃𝑔 𝑔:ω–1-1→(𝐴 ∖ {𝐵}))
91	6, 90	exlimddv 1910	. 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃𝑔 𝑔:ω–1-1→(𝐴 ∖ {𝐵}))
92		reldom 6799	. . . . . 6 ⊢ Rel ≼
93	92	brrelex2i 4703	. . . . 5 ⊢ (ω ≼ 𝐴 → 𝐴 ∈ V)
94		difexg 4170	. . . . 5 ⊢ (𝐴 ∈ V → (𝐴 ∖ {𝐵}) ∈ V)
95	93, 94	syl 14	. . . 4 ⊢ (ω ≼ 𝐴 → (𝐴 ∖ {𝐵}) ∈ V)
96	95	3ad2ant2 1021	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐴 ∖ {𝐵}) ∈ V)
97		brdomg 6802	. . 3 ⊢ ((𝐴 ∖ {𝐵}) ∈ V → (ω ≼ (𝐴 ∖ {𝐵}) ↔ ∃𝑔 𝑔:ω–1-1→(𝐴 ∖ {𝐵})))
98	96, 97	syl 14	. 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) → (ω ≼ (𝐴 ∖ {𝐵}) ↔ ∃𝑔 𝑔:ω–1-1→(𝐴 ∖ {𝐵})))
99	91, 98	mpbird 167	1 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) → ω ≼ (𝐴 ∖ {𝐵}))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 DECID wdc 835 ∧ w3a 980 = wceq 1364 ∃wex 1503 ∈ wcel 2164 ≠ wne 2364 ∀wral 2472 Vcvv 2760 ∖ cdif 3150 ⊆ wss 3153 ∅c0 3446 ifcif 3557 {csn 3618 class class class wbr 4029 ↦ cmpt 4090 ωcom 4622 ran crn 4660 ↾ cres 4661 ∘ ccom 4663 Fn wfn 5249 ⟶wf 5250 –1-1→wf1 5251 ‘cfv 5254 1_oc1o 6462 ≈ cen 6792 ≼ cdom 6793 ⊔ cdju 7096 inlcinl 7104 inrcinr 7105

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-nul 4155 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-iinf 4620

This theorem depends on definitions: df-bi 117 df-dc 836 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-if 3558 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-tr 4128 df-id 4324 df-iord 4397 df-on 4399 df-suc 4402 df-iom 4623 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-1st 6193 df-2nd 6194 df-1o 6469 df-er 6587 df-en 6795 df-dom 6796 df-dju 7097 df-inl 7106 df-inr 7107 df-case 7143

This theorem is referenced by: difinfinf 7160

W3C validator