Theorem disjf1o 45909

Description: A bijection built from disjoint sets. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Hypotheses

Ref	Expression
disjf1o.xph	⊢ Ⅎ𝑥𝜑
disjf1o.f	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
disjf1o.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
disjf1o.dj	⊢ (𝜑 → Disj 𝑥 ∈ 𝐴 𝐵)
disjf1o.d	⊢ 𝐶 = {𝑥 ∈ 𝐴 ∣ 𝐵 ≠ ∅}
disjf1o.e	⊢ 𝐷 = (ran 𝐹 ∖ {∅})

Assertion

Ref	Expression
disjf1o	⊢ (𝜑 → (𝐹 ↾ 𝐶):𝐶–1-1-onto→𝐷)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐶   𝑥,𝐷   𝑥,𝑉

Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)   𝐹(𝑥)

Proof of Theorem disjf1o

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		disjf1o.xph	. . . 4 ⊢ Ⅎ𝑥𝜑
2		eqid 2763	. . . 4 ⊢ (𝑥 ∈ 𝐶 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐵)
3		simpl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝜑)
4		disjf1o.d	. . . . . . . 8 ⊢ 𝐶 = {𝑥 ∈ 𝐴 ∣ 𝐵 ≠ ∅}
5		ssrab2 4034	. . . . . . . 8 ⊢ {𝑥 ∈ 𝐴 ∣ 𝐵 ≠ ∅} ⊆ 𝐴
6	4, 5	eqsstri 3983	. . . . . . 7 ⊢ 𝐶 ⊆ 𝐴
7		id 23	. . . . . . 7 ⊢ (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐶)
8	6, 7	sselid 3935	. . . . . 6 ⊢ (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐴)
9	8	adantl 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ 𝐴)
10		disjf1o.b	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
11	3, 9, 10	syl2anc 595	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐵 ∈ 𝑉)
12	7, 4	eleqtrdi 2873	. . . . . . 7 ⊢ (𝑥 ∈ 𝐶 → 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 ≠ ∅})
13		rabid 3437	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 ≠ ∅} ↔ (𝑥 ∈ 𝐴 ∧ 𝐵 ≠ ∅))
14	13	a1i 11	. . . . . . 7 ⊢ (𝑥 ∈ 𝐶 → (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 ≠ ∅} ↔ (𝑥 ∈ 𝐴 ∧ 𝐵 ≠ ∅)))
15	12, 14	mpbid 235	. . . . . 6 ⊢ (𝑥 ∈ 𝐶 → (𝑥 ∈ 𝐴 ∧ 𝐵 ≠ ∅))
16	15	simprd 500	. . . . 5 ⊢ (𝑥 ∈ 𝐶 → 𝐵 ≠ ∅)
17	16	adantl 486	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝐵 ≠ ∅)
18	6	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐶 ⊆ 𝐴)
19		disjf1o.dj	. . . . 5 ⊢ (𝜑 → Disj 𝑥 ∈ 𝐴 𝐵)
20		disjss1 5082	. . . . 5 ⊢ (𝐶 ⊆ 𝐴 → (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑥 ∈ 𝐶 𝐵))
21	18, 19, 20	sylc 66	. . . 4 ⊢ (𝜑 → Disj 𝑥 ∈ 𝐶 𝐵)
22	1, 2, 11, 17, 21	disjf1 45901	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ 𝐵):𝐶–1-1→𝑉)
23		f1f1orn 6832	. . 3 ⊢ ((𝑥 ∈ 𝐶 ↦ 𝐵):𝐶–1-1→𝑉 → (𝑥 ∈ 𝐶 ↦ 𝐵):𝐶–1-1-onto→ran (𝑥 ∈ 𝐶 ↦ 𝐵))
24	22, 23	syl 18	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐶 ↦ 𝐵):𝐶–1-1-onto→ran (𝑥 ∈ 𝐶 ↦ 𝐵))
25		disjf1o.f	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
26	25	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵))
27	26	reseq1d 5977	. . . 4 ⊢ (𝜑 → (𝐹 ↾ 𝐶) = ((𝑥 ∈ 𝐴 ↦ 𝐵) ↾ 𝐶))
28	18	resmptd 6042	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ↾ 𝐶) = (𝑥 ∈ 𝐶 ↦ 𝐵))
29	27, 28	eqtrd 2798	. . 3 ⊢ (𝜑 → (𝐹 ↾ 𝐶) = (𝑥 ∈ 𝐶 ↦ 𝐵))
30		eqidd 2764	. . 3 ⊢ (𝜑 → 𝐶 = 𝐶)
31		simpl 487	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → 𝜑)
32		id 23	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐷 → 𝑦 ∈ 𝐷)
33		disjf1o.e	. . . . . . . . . 10 ⊢ 𝐷 = (ran 𝐹 ∖ {∅})
34	32, 33	eleqtrdi 2873	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐷 → 𝑦 ∈ (ran 𝐹 ∖ {∅}))
35		eldifsni 4758	. . . . . . . . 9 ⊢ (𝑦 ∈ (ran 𝐹 ∖ {∅}) → 𝑦 ≠ ∅)
36	34, 35	syl 18	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐷 → 𝑦 ≠ ∅)
37	36	adantl 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → 𝑦 ≠ ∅)
38		eldifi 4085	. . . . . . . . . 10 ⊢ (𝑦 ∈ (ran 𝐹 ∖ {∅}) → 𝑦 ∈ ran 𝐹)
39	34, 38	syl 18	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐷 → 𝑦 ∈ ran 𝐹)
40	25	elrnmpt 5948	. . . . . . . . . 10 ⊢ (𝑦 ∈ ran 𝐹 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵))
41	39, 40	syl 18	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐷 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵))
42	39, 41	mpbid 235	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐷 → ∃𝑥 ∈ 𝐴 𝑦 = 𝐵)
43	42	adantl 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐵)
44		nfv 1944	. . . . . . . . . 10 ⊢ Ⅎ𝑥 𝑦 ≠ ∅
45	1, 44	nfan 1929	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑦 ≠ ∅)
46		nfcv 2925	. . . . . . . . . 10 ⊢ Ⅎ𝑥𝑦
47		nfmpt1 5210	. . . . . . . . . . 11 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐶 ↦ 𝐵)
48	47	nfrn 5942	. . . . . . . . . 10 ⊢ Ⅎ𝑥ran (𝑥 ∈ 𝐶 ↦ 𝐵)
49	46, 48	nfel 2939	. . . . . . . . 9 ⊢ Ⅎ𝑥 𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵)
50		simp3 1156	. . . . . . . . . . . 12 ⊢ ((𝑦 ≠ ∅ ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵)
51		simp2 1155	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ≠ ∅ ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝑥 ∈ 𝐴)
52		id 23	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝐵 → 𝑦 = 𝐵)
53	52	eqcomd 2769	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝐵 → 𝐵 = 𝑦)
54	53	adantl 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ≠ ∅ ∧ 𝑦 = 𝐵) → 𝐵 = 𝑦)
55		simpl 487	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ≠ ∅ ∧ 𝑦 = 𝐵) → 𝑦 ≠ ∅)
56	54, 55	eqnetrd 3025	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑦 ≠ ∅ ∧ 𝑦 = 𝐵) → 𝐵 ≠ ∅)
57	56	3adant2 1149	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ≠ ∅ ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝐵 ≠ ∅)
58	51, 57	jca 520	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ≠ ∅ ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 ∈ 𝐴 ∧ 𝐵 ≠ ∅))
59	58, 13	sylibr 237	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ≠ ∅ ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝐵 ≠ ∅})
60	4	eqcomi 2772	. . . . . . . . . . . . . . 15 ⊢ {𝑥 ∈ 𝐴 ∣ 𝐵 ≠ ∅} = 𝐶
61	60	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ≠ ∅ ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → {𝑥 ∈ 𝐴 ∣ 𝐵 ≠ ∅} = 𝐶)
62	59, 61	eleqtrd 2865	. . . . . . . . . . . . 13 ⊢ ((𝑦 ≠ ∅ ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝑥 ∈ 𝐶)
63		eqvisset 3475	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝐵 → 𝐵 ∈ V)
64	63	3ad2ant3 1153	. . . . . . . . . . . . 13 ⊢ ((𝑦 ≠ ∅ ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝐵 ∈ V)
65	2	elrnmpt1 5950	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝐵 ∈ V) → 𝐵 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵))
66	62, 64, 65	syl2anc 595	. . . . . . . . . . . 12 ⊢ ((𝑦 ≠ ∅ ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝐵 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵))
67	50, 66	eqeltrd 2863	. . . . . . . . . . 11 ⊢ ((𝑦 ≠ ∅ ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵))
68	67	3adant1l 1195	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ≠ ∅) ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵))
69	68	3exp 1137	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ≠ ∅) → (𝑥 ∈ 𝐴 → (𝑦 = 𝐵 → 𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵))))
70	45, 49, 69	rexlimd 3272	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ≠ ∅) → (∃𝑥 ∈ 𝐴 𝑦 = 𝐵 → 𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵)))
71	70	imp 411	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ≠ ∅) ∧ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵) → 𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵))
72	31, 37, 43, 71	syl21anc 850	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → 𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵))
73	72	ralrimiva 3157	. . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐷 𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵))
74		dfss3 3926	. . . . 5 ⊢ (𝐷 ⊆ ran (𝑥 ∈ 𝐶 ↦ 𝐵) ↔ ∀𝑦 ∈ 𝐷 𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵))
75	73, 74	sylibr 237	. . . 4 ⊢ (𝜑 → 𝐷 ⊆ ran (𝑥 ∈ 𝐶 ↦ 𝐵))
76		simpl 487	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵)) → 𝜑)
77		vex 3459	. . . . . . 7 ⊢ 𝑦 ∈ V
78	2	elrnmpt 5948	. . . . . . 7 ⊢ (𝑦 ∈ V → (𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵) ↔ ∃𝑥 ∈ 𝐶 𝑦 = 𝐵))
79	77, 78	ax-mp 5	. . . . . 6 ⊢ (𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵) ↔ ∃𝑥 ∈ 𝐶 𝑦 = 𝐵)
80	79	bilani 509	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵)) → ∃𝑥 ∈ 𝐶 𝑦 = 𝐵)
81		nfv 1944	. . . . . . 7 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐷
82		simpr 489	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵)
83	8	adantr 485	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐵) → 𝑥 ∈ 𝐴)
84	82, 63	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐵) → 𝐵 ∈ V)
85	25	elrnmpt1 5950	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ V) → 𝐵 ∈ ran 𝐹)
86	83, 84, 85	syl2anc 595	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐵) → 𝐵 ∈ ran 𝐹)
87	82, 86	eqeltrd 2863	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐵) → 𝑦 ∈ ran 𝐹)
88	87	3adant1 1148	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐵) → 𝑦 ∈ ran 𝐹)
89	16	adantr 485	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐵) → 𝐵 ≠ ∅)
90	82, 89	eqnetrd 3025	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐵) → 𝑦 ≠ ∅)
91		nelsn 4632	. . . . . . . . . . . 12 ⊢ (𝑦 ≠ ∅ → ¬ 𝑦 ∈ {∅})
92	90, 91	syl 18	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐵) → ¬ 𝑦 ∈ {∅})
93	92	3adant1 1148	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐵) → ¬ 𝑦 ∈ {∅})
94	88, 93	eldifd 3916	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐵) → 𝑦 ∈ (ran 𝐹 ∖ {∅}))
95	94, 33	eleqtrrdi 2874	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐵) → 𝑦 ∈ 𝐷)
96	95	3exp 1137	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐶 → (𝑦 = 𝐵 → 𝑦 ∈ 𝐷)))
97	1, 81, 96	rexlimd 3272	. . . . . 6 ⊢ (𝜑 → (∃𝑥 ∈ 𝐶 𝑦 = 𝐵 → 𝑦 ∈ 𝐷))
98	97	imp 411	. . . . 5 ⊢ ((𝜑 ∧ ∃𝑥 ∈ 𝐶 𝑦 = 𝐵) → 𝑦 ∈ 𝐷)
99	76, 80, 98	syl2anc 595	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ran (𝑥 ∈ 𝐶 ↦ 𝐵)) → 𝑦 ∈ 𝐷)
100	75, 99	eqelssd 3958	. . 3 ⊢ (𝜑 → 𝐷 = ran (𝑥 ∈ 𝐶 ↦ 𝐵))
101	29, 30, 100	f1oeq123d 6814	. 2 ⊢ (𝜑 → ((𝐹 ↾ 𝐶):𝐶–1-1-onto→𝐷 ↔ (𝑥 ∈ 𝐶 ↦ 𝐵):𝐶–1-1-onto→ran (𝑥 ∈ 𝐶 ↦ 𝐵)))
102	24, 101	mpbird 260	1 ⊢ (𝜑 → (𝐹 ↾ 𝐶):𝐶–1-1-onto→𝐷)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570  Ⅎwnf 1813   ∈ wcel 2143   ≠ wne 2958  ∀wral 3079  ∃wrex 3089  {crab 3416  Vcvv 3455   ∖ cdif 3902   ⊆ wss 3905  ∅c0 4286  {csn 4589  Disj wdisj 5076   ↦ cmpt 5192  ran crn 5662   ↾ cres 5663  –1-1→wf1 6533  –1-1-onto→wf1o 6535

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-disj 5077  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544

This theorem is referenced by:  sge0fodjrnlem  47130