Theorem infdifsn 9698

Description: Removing a singleton from an infinite set does not change the cardinality of the set. (Contributed by Mario Carneiro, 30-Apr-2015.) (Revised by Mario Carneiro, 16-May-2015.)

Assertion

Ref	Expression
infdifsn	⊢ (ω ≼ 𝐴 → (𝐴 ∖ {𝐵}) ≈ 𝐴)

Proof of Theorem infdifsn

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		brdomi 9000	. . . 4 ⊢ (ω ≼ 𝐴 → ∃𝑓 𝑓:ω–1-1→𝐴)
2	1	adantr 480	. . 3 ⊢ ((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) → ∃𝑓 𝑓:ω–1-1→𝐴)
3		reldom 8992	. . . . . . 7 ⊢ Rel ≼
4	3	brrelex2i 5741	. . . . . 6 ⊢ (ω ≼ 𝐴 → 𝐴 ∈ V)
5	4	ad2antrr 726	. . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → 𝐴 ∈ V)
6		simplr 768	. . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → 𝐵 ∈ 𝐴)
7		f1f 6803	. . . . . . 7 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω⟶𝐴)
8	7	adantl 481	. . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → 𝑓:ω⟶𝐴)
9		peano1 7911	. . . . . 6 ⊢ ∅ ∈ ω
10		ffvelcdm 7100	. . . . . 6 ⊢ ((𝑓:ω⟶𝐴 ∧ ∅ ∈ ω) → (𝑓‘∅) ∈ 𝐴)
11	8, 9, 10	sylancl 586	. . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (𝑓‘∅) ∈ 𝐴)
12		difsnen 9094	. . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ 𝐴 ∧ (𝑓‘∅) ∈ 𝐴) → (𝐴 ∖ {𝐵}) ≈ (𝐴 ∖ {(𝑓‘∅)}))
13	5, 6, 11, 12	syl3anc 1372	. . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (𝐴 ∖ {𝐵}) ≈ (𝐴 ∖ {(𝑓‘∅)}))
14		vex 3483	. . . . . . . . . 10 ⊢ 𝑓 ∈ V
15		f1f1orn 6858	. . . . . . . . . . 11 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓:ω–1-1-onto→ran 𝑓)
16	15	adantl 481	. . . . . . . . . 10 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → 𝑓:ω–1-1-onto→ran 𝑓)
17		f1oen3g 9008	. . . . . . . . . 10 ⊢ ((𝑓 ∈ V ∧ 𝑓:ω–1-1-onto→ran 𝑓) → ω ≈ ran 𝑓)
18	14, 16, 17	sylancr 587	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ω ≈ ran 𝑓)
19	18	ensymd 9046	. . . . . . . 8 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ran 𝑓 ≈ ω)
20	3	brrelex1i 5740	. . . . . . . . . . 11 ⊢ (ω ≼ 𝐴 → ω ∈ V)
21	20	ad2antrr 726	. . . . . . . . . 10 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ω ∈ V)
22		limom 7904	. . . . . . . . . . 11 ⊢ Lim ω
23	22	limenpsi 9193	. . . . . . . . . 10 ⊢ (ω ∈ V → ω ≈ (ω ∖ {∅}))
24	21, 23	syl 17	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ω ≈ (ω ∖ {∅}))
25	14	resex 6046	. . . . . . . . . . 11 ⊢ (𝑓 ↾ (ω ∖ {∅})) ∈ V
26		simpr 484	. . . . . . . . . . . 12 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → 𝑓:ω–1-1→𝐴)
27		difss 4135	. . . . . . . . . . . 12 ⊢ (ω ∖ {∅}) ⊆ ω
28		f1ores 6861	. . . . . . . . . . . 12 ⊢ ((𝑓:ω–1-1→𝐴 ∧ (ω ∖ {∅}) ⊆ ω) → (𝑓 ↾ (ω ∖ {∅})):(ω ∖ {∅})–1-1-onto→(𝑓 “ (ω ∖ {∅})))
29	26, 27, 28	sylancl 586	. . . . . . . . . . 11 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (𝑓 ↾ (ω ∖ {∅})):(ω ∖ {∅})–1-1-onto→(𝑓 “ (ω ∖ {∅})))
30		f1oen3g 9008	. . . . . . . . . . 11 ⊢ (((𝑓 ↾ (ω ∖ {∅})) ∈ V ∧ (𝑓 ↾ (ω ∖ {∅})):(ω ∖ {∅})–1-1-onto→(𝑓 “ (ω ∖ {∅}))) → (ω ∖ {∅}) ≈ (𝑓 “ (ω ∖ {∅})))
31	25, 29, 30	sylancr 587	. . . . . . . . . 10 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (ω ∖ {∅}) ≈ (𝑓 “ (ω ∖ {∅})))
32		f1orn 6857	. . . . . . . . . . . . 13 ⊢ (𝑓:ω–1-1-onto→ran 𝑓 ↔ (𝑓 Fn ω ∧ Fun ◡𝑓))
33	32	simprbi 496	. . . . . . . . . . . 12 ⊢ (𝑓:ω–1-1-onto→ran 𝑓 → Fun ◡𝑓)
34		imadif 6649	. . . . . . . . . . . 12 ⊢ (Fun ◡𝑓 → (𝑓 “ (ω ∖ {∅})) = ((𝑓 “ ω) ∖ (𝑓 “ {∅})))
35	16, 33, 34	3syl 18	. . . . . . . . . . 11 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (𝑓 “ (ω ∖ {∅})) = ((𝑓 “ ω) ∖ (𝑓 “ {∅})))
36		f1fn 6804	. . . . . . . . . . . . . 14 ⊢ (𝑓:ω–1-1→𝐴 → 𝑓 Fn ω)
37	36	adantl 481	. . . . . . . . . . . . 13 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → 𝑓 Fn ω)
38		fnima 6697	. . . . . . . . . . . . 13 ⊢ (𝑓 Fn ω → (𝑓 “ ω) = ran 𝑓)
39	37, 38	syl 17	. . . . . . . . . . . 12 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (𝑓 “ ω) = ran 𝑓)
40		fnsnfv 6987	. . . . . . . . . . . . . 14 ⊢ ((𝑓 Fn ω ∧ ∅ ∈ ω) → {(𝑓‘∅)} = (𝑓 “ {∅}))
41	37, 9, 40	sylancl 586	. . . . . . . . . . . . 13 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → {(𝑓‘∅)} = (𝑓 “ {∅}))
42	41	eqcomd 2742	. . . . . . . . . . . 12 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (𝑓 “ {∅}) = {(𝑓‘∅)})
43	39, 42	difeq12d 4126	. . . . . . . . . . 11 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ((𝑓 “ ω) ∖ (𝑓 “ {∅})) = (ran 𝑓 ∖ {(𝑓‘∅)}))
44	35, 43	eqtrd 2776	. . . . . . . . . 10 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (𝑓 “ (ω ∖ {∅})) = (ran 𝑓 ∖ {(𝑓‘∅)}))
45	31, 44	breqtrd 5168	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (ω ∖ {∅}) ≈ (ran 𝑓 ∖ {(𝑓‘∅)}))
46		entr 9047	. . . . . . . . 9 ⊢ ((ω ≈ (ω ∖ {∅}) ∧ (ω ∖ {∅}) ≈ (ran 𝑓 ∖ {(𝑓‘∅)})) → ω ≈ (ran 𝑓 ∖ {(𝑓‘∅)}))
47	24, 45, 46	syl2anc 584	. . . . . . . 8 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ω ≈ (ran 𝑓 ∖ {(𝑓‘∅)}))
48		entr 9047	. . . . . . . 8 ⊢ ((ran 𝑓 ≈ ω ∧ ω ≈ (ran 𝑓 ∖ {(𝑓‘∅)})) → ran 𝑓 ≈ (ran 𝑓 ∖ {(𝑓‘∅)}))
49	19, 47, 48	syl2anc 584	. . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ran 𝑓 ≈ (ran 𝑓 ∖ {(𝑓‘∅)}))
50		difexg 5328	. . . . . . . 8 ⊢ (𝐴 ∈ V → (𝐴 ∖ ran 𝑓) ∈ V)
51		enrefg 9025	. . . . . . . 8 ⊢ ((𝐴 ∖ ran 𝑓) ∈ V → (𝐴 ∖ ran 𝑓) ≈ (𝐴 ∖ ran 𝑓))
52	5, 50, 51	3syl 18	. . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (𝐴 ∖ ran 𝑓) ≈ (𝐴 ∖ ran 𝑓))
53		disjdif 4471	. . . . . . . 8 ⊢ (ran 𝑓 ∩ (𝐴 ∖ ran 𝑓)) = ∅
54	53	a1i 11	. . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (ran 𝑓 ∩ (𝐴 ∖ ran 𝑓)) = ∅)
55		difss 4135	. . . . . . . . . 10 ⊢ (ran 𝑓 ∖ {(𝑓‘∅)}) ⊆ ran 𝑓
56		ssrin 4241	. . . . . . . . . 10 ⊢ ((ran 𝑓 ∖ {(𝑓‘∅)}) ⊆ ran 𝑓 → ((ran 𝑓 ∖ {(𝑓‘∅)}) ∩ (𝐴 ∖ ran 𝑓)) ⊆ (ran 𝑓 ∩ (𝐴 ∖ ran 𝑓)))
57	55, 56	ax-mp 5	. . . . . . . . 9 ⊢ ((ran 𝑓 ∖ {(𝑓‘∅)}) ∩ (𝐴 ∖ ran 𝑓)) ⊆ (ran 𝑓 ∩ (𝐴 ∖ ran 𝑓))
58		sseq0 4402	. . . . . . . . 9 ⊢ ((((ran 𝑓 ∖ {(𝑓‘∅)}) ∩ (𝐴 ∖ ran 𝑓)) ⊆ (ran 𝑓 ∩ (𝐴 ∖ ran 𝑓)) ∧ (ran 𝑓 ∩ (𝐴 ∖ ran 𝑓)) = ∅) → ((ran 𝑓 ∖ {(𝑓‘∅)}) ∩ (𝐴 ∖ ran 𝑓)) = ∅)
59	57, 53, 58	mp2an 692	. . . . . . . 8 ⊢ ((ran 𝑓 ∖ {(𝑓‘∅)}) ∩ (𝐴 ∖ ran 𝑓)) = ∅
60	59	a1i 11	. . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ((ran 𝑓 ∖ {(𝑓‘∅)}) ∩ (𝐴 ∖ ran 𝑓)) = ∅)
61		unen 9087	. . . . . . 7 ⊢ (((ran 𝑓 ≈ (ran 𝑓 ∖ {(𝑓‘∅)}) ∧ (𝐴 ∖ ran 𝑓) ≈ (𝐴 ∖ ran 𝑓)) ∧ ((ran 𝑓 ∩ (𝐴 ∖ ran 𝑓)) = ∅ ∧ ((ran 𝑓 ∖ {(𝑓‘∅)}) ∩ (𝐴 ∖ ran 𝑓)) = ∅)) → (ran 𝑓 ∪ (𝐴 ∖ ran 𝑓)) ≈ ((ran 𝑓 ∖ {(𝑓‘∅)}) ∪ (𝐴 ∖ ran 𝑓)))
62	49, 52, 54, 60, 61	syl22anc 838	. . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (ran 𝑓 ∪ (𝐴 ∖ ran 𝑓)) ≈ ((ran 𝑓 ∖ {(𝑓‘∅)}) ∪ (𝐴 ∖ ran 𝑓)))
63	8	frnd 6743	. . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ran 𝑓 ⊆ 𝐴)
64		undif 4481	. . . . . . 7 ⊢ (ran 𝑓 ⊆ 𝐴 ↔ (ran 𝑓 ∪ (𝐴 ∖ ran 𝑓)) = 𝐴)
65	63, 64	sylib 218	. . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (ran 𝑓 ∪ (𝐴 ∖ ran 𝑓)) = 𝐴)
66		uncom 4157	. . . . . . 7 ⊢ ((ran 𝑓 ∖ {(𝑓‘∅)}) ∪ (𝐴 ∖ ran 𝑓)) = ((𝐴 ∖ ran 𝑓) ∪ (ran 𝑓 ∖ {(𝑓‘∅)}))
67		eldifn 4131	. . . . . . . . . . 11 ⊢ ((𝑓‘∅) ∈ (𝐴 ∖ ran 𝑓) → ¬ (𝑓‘∅) ∈ ran 𝑓)
68		fnfvelrn 7099	. . . . . . . . . . . 12 ⊢ ((𝑓 Fn ω ∧ ∅ ∈ ω) → (𝑓‘∅) ∈ ran 𝑓)
69	37, 9, 68	sylancl 586	. . . . . . . . . . 11 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (𝑓‘∅) ∈ ran 𝑓)
70	67, 69	nsyl3 138	. . . . . . . . . 10 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ¬ (𝑓‘∅) ∈ (𝐴 ∖ ran 𝑓))
71		disjsn 4710	. . . . . . . . . 10 ⊢ (((𝐴 ∖ ran 𝑓) ∩ {(𝑓‘∅)}) = ∅ ↔ ¬ (𝑓‘∅) ∈ (𝐴 ∖ ran 𝑓))
72	70, 71	sylibr 234	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ((𝐴 ∖ ran 𝑓) ∩ {(𝑓‘∅)}) = ∅)
73		undif4 4466	. . . . . . . . 9 ⊢ (((𝐴 ∖ ran 𝑓) ∩ {(𝑓‘∅)}) = ∅ → ((𝐴 ∖ ran 𝑓) ∪ (ran 𝑓 ∖ {(𝑓‘∅)})) = (((𝐴 ∖ ran 𝑓) ∪ ran 𝑓) ∖ {(𝑓‘∅)}))
74	72, 73	syl 17	. . . . . . . 8 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ((𝐴 ∖ ran 𝑓) ∪ (ran 𝑓 ∖ {(𝑓‘∅)})) = (((𝐴 ∖ ran 𝑓) ∪ ran 𝑓) ∖ {(𝑓‘∅)}))
75		uncom 4157	. . . . . . . . . 10 ⊢ ((𝐴 ∖ ran 𝑓) ∪ ran 𝑓) = (ran 𝑓 ∪ (𝐴 ∖ ran 𝑓))
76	75, 65	eqtrid 2788	. . . . . . . . 9 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ((𝐴 ∖ ran 𝑓) ∪ ran 𝑓) = 𝐴)
77	76	difeq1d 4124	. . . . . . . 8 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (((𝐴 ∖ ran 𝑓) ∪ ran 𝑓) ∖ {(𝑓‘∅)}) = (𝐴 ∖ {(𝑓‘∅)}))
78	74, 77	eqtrd 2776	. . . . . . 7 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ((𝐴 ∖ ran 𝑓) ∪ (ran 𝑓 ∖ {(𝑓‘∅)})) = (𝐴 ∖ {(𝑓‘∅)}))
79	66, 78	eqtrid 2788	. . . . . 6 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → ((ran 𝑓 ∖ {(𝑓‘∅)}) ∪ (𝐴 ∖ ran 𝑓)) = (𝐴 ∖ {(𝑓‘∅)}))
80	62, 65, 79	3brtr3d 5173	. . . . 5 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → 𝐴 ≈ (𝐴 ∖ {(𝑓‘∅)}))
81	80	ensymd 9046	. . . 4 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (𝐴 ∖ {(𝑓‘∅)}) ≈ 𝐴)
82		entr 9047	. . . 4 ⊢ (((𝐴 ∖ {𝐵}) ≈ (𝐴 ∖ {(𝑓‘∅)}) ∧ (𝐴 ∖ {(𝑓‘∅)}) ≈ 𝐴) → (𝐴 ∖ {𝐵}) ≈ 𝐴)
83	13, 81, 82	syl2anc 584	. . 3 ⊢ (((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) ∧ 𝑓:ω–1-1→𝐴) → (𝐴 ∖ {𝐵}) ≈ 𝐴)
84	2, 83	exlimddv 1934	. 2 ⊢ ((ω ≼ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝐴 ∖ {𝐵}) ≈ 𝐴)
85		difsn 4797	. . . 4 ⊢ (¬ 𝐵 ∈ 𝐴 → (𝐴 ∖ {𝐵}) = 𝐴)
86	85	adantl 481	. . 3 ⊢ ((ω ≼ 𝐴 ∧ ¬ 𝐵 ∈ 𝐴) → (𝐴 ∖ {𝐵}) = 𝐴)
87		enrefg 9025	. . . . 5 ⊢ (𝐴 ∈ V → 𝐴 ≈ 𝐴)
88	4, 87	syl 17	. . . 4 ⊢ (ω ≼ 𝐴 → 𝐴 ≈ 𝐴)
89	88	adantr 480	. . 3 ⊢ ((ω ≼ 𝐴 ∧ ¬ 𝐵 ∈ 𝐴) → 𝐴 ≈ 𝐴)
90	86, 89	eqbrtrd 5164	. 2 ⊢ ((ω ≼ 𝐴 ∧ ¬ 𝐵 ∈ 𝐴) → (𝐴 ∖ {𝐵}) ≈ 𝐴)
91	84, 90	pm2.61dan 812	1 ⊢ (ω ≼ 𝐴 → (𝐴 ∖ {𝐵}) ≈ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1539  ∃wex 1778   ∈ wcel 2107  Vcvv 3479   ∖ cdif 3947   ∪ cun 3948   ∩ cin 3949   ⊆ wss 3950  ∅c0 4332  {csn 4625   class class class wbr 5142  ^◡ccnv 5683  ran crn 5685   ↾ cres 5686   “ cima 5687  Fun wfun 6554   Fn wfn 6555  ⟶wf 6556  –1-1→wf1 6557  –1-1-onto→wf1o 6559  ‘cfv 6560  ωcom 7888   ≈ cen 8983   ≼ cdom 8984

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-br 5143  df-opab 5205  df-mpt 5225  df-tr 5259  df-id 5577  df-eprel 5583  df-po 5591  df-so 5592  df-fr 5636  df-we 5638  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-om 7889  df-er 8746  df-en 8987  df-dom 8988

This theorem is referenced by:  infdiffi  9699  infdju1  10231  infpss  10257