Theorem hashf1lem1 11285

Description: Lemma for hashf1 11287. (Contributed by Mario Carneiro, 17-Apr-2015.) (Proof shortened by AV, 14-Aug-2024.)

Hypotheses

Ref	Expression
hashf1lem2.1	⊢ (𝜑 → 𝐴 ∈ Fin)
hashf1lem2.2	⊢ (𝜑 → 𝐵 ∈ Fin)
hashf1lem2.3	⊢ (𝜑 → ¬ 𝑧 ∈ 𝐴)
hashf1lem2.4	⊢ (𝜑 → ((♯‘𝐴) + 1) ≤ (♯‘𝐵))
hashf1lem1.5	⊢ (𝜑 → 𝐹:𝐴–1-1→𝐵)

Assertion

Ref	Expression
hashf1lem1	⊢ (𝜑 → {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ≈ (𝐵 ∖ ran 𝐹))

Distinct variable groups:   𝑧,𝑓   𝐴,𝑓   𝐵,𝑓   𝜑,𝑓   𝑓,𝐹

Allowed substitution hints:   𝜑(𝑧)   𝐴(𝑧)   𝐵(𝑧)   𝐹(𝑧)

Proof of Theorem hashf1lem1

Dummy variables 𝑔 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		hashf1lem2.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ Fin)
2		vex 2824	. . . . . 6 ⊢ 𝑧 ∈ V
3	2	a1i 9	. . . . 5 ⊢ (𝜑 → 𝑧 ∈ V)
4		hashf1lem2.3	. . . . 5 ⊢ (𝜑 → ¬ 𝑧 ∈ 𝐴)
5		unsnfi 7226	. . . . 5 ⊢ ((𝐴 ∈ Fin ∧ 𝑧 ∈ V ∧ ¬ 𝑧 ∈ 𝐴) → (𝐴 ∪ {𝑧}) ∈ Fin)
6	1, 3, 4, 5	syl3anc 1278	. . . 4 ⊢ (𝜑 → (𝐴 ∪ {𝑧}) ∈ Fin)
7		hashf1lem2.2	. . . 4 ⊢ (𝜑 → 𝐵 ∈ Fin)
8		f1setexg 6951	. . . 4 ⊢ (((𝐴 ∪ {𝑧}) ∈ Fin ∧ 𝐵 ∈ Fin) → {𝑓 ∣ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵} ∈ V)
9	6, 7, 8	syl2anc 415	. . 3 ⊢ (𝜑 → {𝑓 ∣ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵} ∈ V)
10		abanssr 3502	. . . 4 ⊢ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ⊆ {𝑓 ∣ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵}
11	10	a1i 9	. . 3 ⊢ (𝜑 → {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ⊆ {𝑓 ∣ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵})
12	9, 11	ssexd 4273	. 2 ⊢ (𝜑 → {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ∈ V)
13	7	difexd 4277	. 2 ⊢ (𝜑 → (𝐵 ∖ ran 𝐹) ∈ V)
14		vex 2824	. . . 4 ⊢ 𝑔 ∈ V
15		reseq1 5057	. . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑓 ↾ 𝐴) = (𝑔 ↾ 𝐴))
16	15	eqeq1d 2247	. . . . 5 ⊢ (𝑓 = 𝑔 → ((𝑓 ↾ 𝐴) = 𝐹 ↔ (𝑔 ↾ 𝐴) = 𝐹))
17		f1eq1 5593	. . . . 5 ⊢ (𝑓 = 𝑔 → (𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵 ↔ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵))
18	16, 17	anbi12d 477	. . . 4 ⊢ (𝑓 = 𝑔 → (((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵) ↔ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)))
19	14, 18	elab 2970	. . 3 ⊢ (𝑔 ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ↔ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵))
20		f1f 5598	. . . . . . 7 ⊢ (𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵 → 𝑔:(𝐴 ∪ {𝑧})⟶𝐵)
21	20	ad2antll 495	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → 𝑔:(𝐴 ∪ {𝑧})⟶𝐵)
22		ssun2 3393	. . . . . . 7 ⊢ {𝑧} ⊆ (𝐴 ∪ {𝑧})
23	2	snss 3850	. . . . . . 7 ⊢ (𝑧 ∈ (𝐴 ∪ {𝑧}) ↔ {𝑧} ⊆ (𝐴 ∪ {𝑧}))
24	22, 23	mpbir 146	. . . . . 6 ⊢ 𝑧 ∈ (𝐴 ∪ {𝑧})
25		ffvelcdm 5841	. . . . . 6 ⊢ ((𝑔:(𝐴 ∪ {𝑧})⟶𝐵 ∧ 𝑧 ∈ (𝐴 ∪ {𝑧})) → (𝑔‘𝑧) ∈ 𝐵)
26	21, 24, 25	sylancl 417	. . . . 5 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → (𝑔‘𝑧) ∈ 𝐵)
27	4	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ¬ 𝑧 ∈ 𝐴)
28		df-ima 4787	. . . . . . . . 9 ⊢ (𝑔 “ 𝐴) = ran (𝑔 ↾ 𝐴)
29		simprl 535	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → (𝑔 ↾ 𝐴) = 𝐹)
30	29	rneqd 5011	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ran (𝑔 ↾ 𝐴) = ran 𝐹)
31	28, 30	eqtrid 2283	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → (𝑔 “ 𝐴) = ran 𝐹)
32	31	eleq2d 2308	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ((𝑔‘𝑧) ∈ (𝑔 “ 𝐴) ↔ (𝑔‘𝑧) ∈ ran 𝐹))
33		simprr 537	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)
34	24	a1i 9	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → 𝑧 ∈ (𝐴 ∪ {𝑧}))
35		ssun1 3392	. . . . . . . . 9 ⊢ 𝐴 ⊆ (𝐴 ∪ {𝑧})
36	35	a1i 9	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → 𝐴 ⊆ (𝐴 ∪ {𝑧}))
37		f1elima 5979	. . . . . . . 8 ⊢ ((𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵 ∧ 𝑧 ∈ (𝐴 ∪ {𝑧}) ∧ 𝐴 ⊆ (𝐴 ∪ {𝑧})) → ((𝑔‘𝑧) ∈ (𝑔 “ 𝐴) ↔ 𝑧 ∈ 𝐴))
38	33, 34, 36, 37	syl3anc 1278	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ((𝑔‘𝑧) ∈ (𝑔 “ 𝐴) ↔ 𝑧 ∈ 𝐴))
39	32, 38	bitr3d 190	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ((𝑔‘𝑧) ∈ ran 𝐹 ↔ 𝑧 ∈ 𝐴))
40	27, 39	mtbird 684	. . . . 5 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ¬ (𝑔‘𝑧) ∈ ran 𝐹)
41	26, 40	eldifd 3230	. . . 4 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → (𝑔‘𝑧) ∈ (𝐵 ∖ ran 𝐹))
42	41	ex 115	. . 3 ⊢ (𝜑 → (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) → (𝑔‘𝑧) ∈ (𝐵 ∖ ran 𝐹)))
43	19, 42	biimtrid 152	. 2 ⊢ (𝜑 → (𝑔 ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} → (𝑔‘𝑧) ∈ (𝐵 ∖ ran 𝐹)))
44		hashf1lem1.5	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴–1-1→𝐵)
45		f1f 5598	. . . . . . 7 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴⟶𝐵)
46	44, 45	syl 14	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
47	46	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → 𝐹:𝐴⟶𝐵)
48		vex 2824	. . . . . . . 8 ⊢ 𝑥 ∈ V
49	2, 48	f1osn 5681	. . . . . . 7 ⊢ {⟨𝑧, 𝑥⟩}:{𝑧}–1-1-onto→{𝑥}
50		f1of 5639	. . . . . . 7 ⊢ ({⟨𝑧, 𝑥⟩}:{𝑧}–1-1-onto→{𝑥} → {⟨𝑧, 𝑥⟩}:{𝑧}⟶{𝑥})
51	49, 50	ax-mp 5	. . . . . 6 ⊢ {⟨𝑧, 𝑥⟩}:{𝑧}⟶{𝑥}
52		eldifi 3351	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐵 ∖ ran 𝐹) → 𝑥 ∈ 𝐵)
53	52	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → 𝑥 ∈ 𝐵)
54	53	snssd 3860	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → {𝑥} ⊆ 𝐵)
55		fss 5546	. . . . . 6 ⊢ (({⟨𝑧, 𝑥⟩}:{𝑧}⟶{𝑥} ∧ {𝑥} ⊆ 𝐵) → {⟨𝑧, 𝑥⟩}:{𝑧}⟶𝐵)
56	51, 54, 55	sylancr 418	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → {⟨𝑧, 𝑥⟩}:{𝑧}⟶𝐵)
57		disjsn 3771	. . . . . . 7 ⊢ ((𝐴 ∩ {𝑧}) = ∅ ↔ ¬ 𝑧 ∈ 𝐴)
58	4, 57	sylibr 134	. . . . . 6 ⊢ (𝜑 → (𝐴 ∩ {𝑧}) = ∅)
59	58	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐴 ∩ {𝑧}) = ∅)
60		fresaunres1disj 5571	. . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ {⟨𝑧, 𝑥⟩}:{𝑧}⟶𝐵 ∧ (𝐴 ∩ {𝑧}) = ∅) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹)
61	47, 56, 59, 60	syl3anc 1278	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹)
62		f1f1orn 5650	. . . . . . . . 9 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴–1-1-onto→ran 𝐹)
63	44, 62	syl 14	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→ran 𝐹)
64	63	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → 𝐹:𝐴–1-1-onto→ran 𝐹)
65	49	a1i 9	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → {⟨𝑧, 𝑥⟩}:{𝑧}–1-1-onto→{𝑥})
66		eldifn 3352	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐵 ∖ ran 𝐹) → ¬ 𝑥 ∈ ran 𝐹)
67	66	adantl 277	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ¬ 𝑥 ∈ ran 𝐹)
68		disjsn 3771	. . . . . . . 8 ⊢ ((ran 𝐹 ∩ {𝑥}) = ∅ ↔ ¬ 𝑥 ∈ ran 𝐹)
69	67, 68	sylibr 134	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (ran 𝐹 ∩ {𝑥}) = ∅)
70		f1oun 5659	. . . . . . 7 ⊢ (((𝐹:𝐴–1-1-onto→ran 𝐹 ∧ {⟨𝑧, 𝑥⟩}:{𝑧}–1-1-onto→{𝑥}) ∧ ((𝐴 ∩ {𝑧}) = ∅ ∧ (ran 𝐹 ∩ {𝑥}) = ∅)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}))
71	64, 65, 59, 69, 70	syl22anc 1279	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}))
72		f1of1 5638	. . . . . 6 ⊢ ((𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→(ran 𝐹 ∪ {𝑥}))
73	71, 72	syl 14	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→(ran 𝐹 ∪ {𝑥}))
74	47	frnd 5543	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ran 𝐹 ⊆ 𝐵)
75	74, 54	unssd 3405	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (ran 𝐹 ∪ {𝑥}) ⊆ 𝐵)
76		f1ss 5604	. . . . 5 ⊢ (((𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→(ran 𝐹 ∪ {𝑥}) ∧ (ran 𝐹 ∪ {𝑥}) ⊆ 𝐵) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)
77	73, 75, 76	syl2anc 415	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)
78	46, 1	fexd 5948	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ V)
79	78	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → 𝐹 ∈ V)
80	2, 48	opex 4369	. . . . . . 7 ⊢ ⟨𝑧, 𝑥⟩ ∈ V
81	80	snex 4322	. . . . . 6 ⊢ {⟨𝑧, 𝑥⟩} ∈ V
82		unexg 4589	. . . . . 6 ⊢ ((𝐹 ∈ V ∧ {⟨𝑧, 𝑥⟩} ∈ V) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ V)
83	79, 81, 82	sylancl 417	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ V)
84		reseq1 5057	. . . . . . . 8 ⊢ (𝑓 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) → (𝑓 ↾ 𝐴) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴))
85	84	eqeq1d 2247	. . . . . . 7 ⊢ (𝑓 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) → ((𝑓 ↾ 𝐴) = 𝐹 ↔ ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹))
86		f1eq1 5593	. . . . . . 7 ⊢ (𝑓 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) → (𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵 ↔ (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵))
87	85, 86	anbi12d 477	. . . . . 6 ⊢ (𝑓 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) → (((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵) ↔ (((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹 ∧ (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)))
88	87	elabg 2972	. . . . 5 ⊢ ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ V → ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ↔ (((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹 ∧ (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)))
89	83, 88	syl 14	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ↔ (((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹 ∧ (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)))
90	61, 77, 89	mpbir2and 957	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)})
91	90	ex 115	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐵 ∖ ran 𝐹) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)}))
92	19	anbi1i 462	. . 3 ⊢ ((𝑔 ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) ↔ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)))
93		simprlr 544	. . . . . . 7 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)
94		f1fn 5600	. . . . . . 7 ⊢ (𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵 → 𝑔 Fn (𝐴 ∪ {𝑧}))
95	93, 94	syl 14	. . . . . 6 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → 𝑔 Fn (𝐴 ∪ {𝑧}))
96	71	adantrl 482	. . . . . . 7 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}))
97		f1ofn 5640	. . . . . . 7 ⊢ ((𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) Fn (𝐴 ∪ {𝑧}))
98	96, 97	syl 14	. . . . . 6 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) Fn (𝐴 ∪ {𝑧}))
99		eqfnfv 5806	. . . . . 6 ⊢ ((𝑔 Fn (𝐴 ∪ {𝑧}) ∧ (𝐹 ∪ {⟨𝑧, 𝑥⟩}) Fn (𝐴 ∪ {𝑧})) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ ∀𝑦 ∈ (𝐴 ∪ {𝑧})(𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦)))
100	95, 98, 99	syl2anc 415	. . . . 5 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ ∀𝑦 ∈ (𝐴 ∪ {𝑧})(𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦)))
101		fvres 5719	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝐴 → ((𝑔 ↾ 𝐴)‘𝑦) = (𝑔‘𝑦))
102	101	eqcomd 2244	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐴 → (𝑔‘𝑦) = ((𝑔 ↾ 𝐴)‘𝑦))
103		simprll 543	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝑔 ↾ 𝐴) = 𝐹)
104	103	fveq1d 5697	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ((𝑔 ↾ 𝐴)‘𝑦) = (𝐹‘𝑦))
105	102, 104	sylan9eqr 2293	. . . . . . . . 9 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → (𝑔‘𝑦) = (𝐹‘𝑦))
106	44	ad2antrr 492	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → 𝐹:𝐴–1-1→𝐵)
107		f1fn 5600	. . . . . . . . . . 11 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹 Fn 𝐴)
108	106, 107	syl 14	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → 𝐹 Fn 𝐴)
109	2, 48	fnsn 5435	. . . . . . . . . . 11 ⊢ {⟨𝑧, 𝑥⟩} Fn {𝑧}
110	109	a1i 9	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → {⟨𝑧, 𝑥⟩} Fn {𝑧})
111	58	ad2antrr 492	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → (𝐴 ∩ {𝑧}) = ∅)
112		simpr 110	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ 𝐴)
113	108, 110, 111, 112	fvun1d 5771	. . . . . . . . 9 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) = (𝐹‘𝑦))
114	105, 113	eqtr4d 2274	. . . . . . . 8 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦))
115	114	ralrimiva 2623	. . . . . . 7 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦))
116	115	biantrurd 305	. . . . . 6 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ∧ ∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦))))
117		ralunb 3410	. . . . . 6 ⊢ (∀𝑦 ∈ (𝐴 ∪ {𝑧})(𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ∧ ∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦)))
118	116, 117	bitr4di 198	. . . . 5 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ ∀𝑦 ∈ (𝐴 ∪ {𝑧})(𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦)))
119	46	fdmd 5540	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐹 = 𝐴)
120	119	eleq2d 2308	. . . . . . . . . 10 ⊢ (𝜑 → (𝑧 ∈ dom 𝐹 ↔ 𝑧 ∈ 𝐴))
121	4, 120	mtbird 684	. . . . . . . . 9 ⊢ (𝜑 → ¬ 𝑧 ∈ dom 𝐹)
122	121	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ¬ 𝑧 ∈ dom 𝐹)
123		fsnunfv 5916	. . . . . . . 8 ⊢ ((𝑧 ∈ V ∧ 𝑥 ∈ V ∧ ¬ 𝑧 ∈ dom 𝐹) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧) = 𝑥)
124	2, 48, 122, 123	mp3an12i 1382	. . . . . . 7 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧) = 𝑥)
125	124	eqeq2d 2250	. . . . . 6 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ((𝑔‘𝑧) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧) ↔ (𝑔‘𝑧) = 𝑥))
126		fveq2 5695	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → (𝑔‘𝑦) = (𝑔‘𝑧))
127		fveq2 5695	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧))
128	126, 127	eqeq12d 2253	. . . . . . 7 ⊢ (𝑦 = 𝑧 → ((𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ (𝑔‘𝑧) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧)))
129	2, 128	ralsn 3752	. . . . . 6 ⊢ (∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ (𝑔‘𝑧) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧))
130		eqcom 2240	. . . . . 6 ⊢ (𝑥 = (𝑔‘𝑧) ↔ (𝑔‘𝑧) = 𝑥)
131	125, 129, 130	3bitr4g 223	. . . . 5 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ 𝑥 = (𝑔‘𝑧)))
132	100, 118, 131	3bitr2d 216	. . . 4 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ 𝑥 = (𝑔‘𝑧)))
133	132	ex 115	. . 3 ⊢ (𝜑 → ((((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ 𝑥 = (𝑔‘𝑧))))
134	92, 133	biimtrid 152	. 2 ⊢ (𝜑 → ((𝑔 ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ 𝑥 = (𝑔‘𝑧))))
135	12, 13, 43, 91, 134	en3d 7055	1 ⊢ (𝜑 → {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ≈ (𝐵 ∖ ran 𝐹))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  {cab 2224  ∀wral 2528  Vcvv 2821   ∖ cdif 3217   ∪ cun 3218   ∩ cin 3219   ⊆ wss 3220  ∅c0 3520  {csn 3709  ⟨cop 3712   class class class wbr 4130  dom cdm 4774  ran crn 4775   ↾ cres 4776   “ cima 4777   Fn wfn 5372  ⟶wf 5373  –1-1→wf1 5374  –1-1-onto→wf1o 5376  ‘cfv 5377  (class class class)co 6085   ≈ cen 7020  Fincfn 7022  1c1 8180   + caddc 8182   ≤ cle 8361  ♯chash 11214

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1o 6687  df-er 6807  df-en 7023  df-fin 7025

This theorem is used by:  hashf1lem2  11286