Theorem hashf1lem1 14096

Description: Lemma for hashf1 14099. (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.2	. . . 4 ⊢ (𝜑 → 𝐵 ∈ Fin)
2		f1setex 8603	. . . 4 ⊢ (𝐵 ∈ Fin → {𝑓 ∣ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵} ∈ V)
3	1, 2	syl 17	. . 3 ⊢ (𝜑 → {𝑓 ∣ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵} ∈ V)
4		abanssr 4233	. . . 4 ⊢ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ⊆ {𝑓 ∣ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵}
5	4	a1i 11	. . 3 ⊢ (𝜑 → {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ⊆ {𝑓 ∣ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵})
6	3, 5	ssexd 5243	. 2 ⊢ (𝜑 → {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ∈ V)
7	1	difexd 5248	. 2 ⊢ (𝜑 → (𝐵 ∖ ran 𝐹) ∈ V)
8		vex 3426	. . . 4 ⊢ 𝑔 ∈ V
9		reseq1 5874	. . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑓 ↾ 𝐴) = (𝑔 ↾ 𝐴))
10	9	eqeq1d 2740	. . . . 5 ⊢ (𝑓 = 𝑔 → ((𝑓 ↾ 𝐴) = 𝐹 ↔ (𝑔 ↾ 𝐴) = 𝐹))
11		f1eq1 6649	. . . . 5 ⊢ (𝑓 = 𝑔 → (𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵 ↔ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵))
12	10, 11	anbi12d 630	. . . 4 ⊢ (𝑓 = 𝑔 → (((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵) ↔ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)))
13	8, 12	elab 3602	. . 3 ⊢ (𝑔 ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ↔ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵))
14		f1f 6654	. . . . . . 7 ⊢ (𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵 → 𝑔:(𝐴 ∪ {𝑧})⟶𝐵)
15	14	ad2antll 725	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → 𝑔:(𝐴 ∪ {𝑧})⟶𝐵)
16		ssun2 4103	. . . . . . 7 ⊢ {𝑧} ⊆ (𝐴 ∪ {𝑧})
17		vex 3426	. . . . . . . 8 ⊢ 𝑧 ∈ V
18	17	snss 4716	. . . . . . 7 ⊢ (𝑧 ∈ (𝐴 ∪ {𝑧}) ↔ {𝑧} ⊆ (𝐴 ∪ {𝑧}))
19	16, 18	mpbir 230	. . . . . 6 ⊢ 𝑧 ∈ (𝐴 ∪ {𝑧})
20		ffvelrn 6941	. . . . . 6 ⊢ ((𝑔:(𝐴 ∪ {𝑧})⟶𝐵 ∧ 𝑧 ∈ (𝐴 ∪ {𝑧})) → (𝑔‘𝑧) ∈ 𝐵)
21	15, 19, 20	sylancl 585	. . . . 5 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → (𝑔‘𝑧) ∈ 𝐵)
22		hashf1lem2.3	. . . . . . 7 ⊢ (𝜑 → ¬ 𝑧 ∈ 𝐴)
23	22	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ¬ 𝑧 ∈ 𝐴)
24		df-ima 5593	. . . . . . . . 9 ⊢ (𝑔 “ 𝐴) = ran (𝑔 ↾ 𝐴)
25		simprl 767	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → (𝑔 ↾ 𝐴) = 𝐹)
26	25	rneqd 5836	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ran (𝑔 ↾ 𝐴) = ran 𝐹)
27	24, 26	eqtrid 2790	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → (𝑔 “ 𝐴) = ran 𝐹)
28	27	eleq2d 2824	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ((𝑔‘𝑧) ∈ (𝑔 “ 𝐴) ↔ (𝑔‘𝑧) ∈ ran 𝐹))
29		simprr 769	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)
30	19	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → 𝑧 ∈ (𝐴 ∪ {𝑧}))
31		ssun1 4102	. . . . . . . . 9 ⊢ 𝐴 ⊆ (𝐴 ∪ {𝑧})
32	31	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → 𝐴 ⊆ (𝐴 ∪ {𝑧}))
33		f1elima 7117	. . . . . . . 8 ⊢ ((𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵 ∧ 𝑧 ∈ (𝐴 ∪ {𝑧}) ∧ 𝐴 ⊆ (𝐴 ∪ {𝑧})) → ((𝑔‘𝑧) ∈ (𝑔 “ 𝐴) ↔ 𝑧 ∈ 𝐴))
34	29, 30, 32, 33	syl3anc 1369	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ((𝑔‘𝑧) ∈ (𝑔 “ 𝐴) ↔ 𝑧 ∈ 𝐴))
35	28, 34	bitr3d 280	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ((𝑔‘𝑧) ∈ ran 𝐹 ↔ 𝑧 ∈ 𝐴))
36	23, 35	mtbird 324	. . . . 5 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ¬ (𝑔‘𝑧) ∈ ran 𝐹)
37	21, 36	eldifd 3894	. . . 4 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → (𝑔‘𝑧) ∈ (𝐵 ∖ ran 𝐹))
38	37	ex 412	. . 3 ⊢ (𝜑 → (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) → (𝑔‘𝑧) ∈ (𝐵 ∖ ran 𝐹)))
39	13, 38	syl5bi 241	. 2 ⊢ (𝜑 → (𝑔 ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} → (𝑔‘𝑧) ∈ (𝐵 ∖ ran 𝐹)))
40		hashf1lem1.5	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴–1-1→𝐵)
41		f1f 6654	. . . . . . 7 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴⟶𝐵)
42	40, 41	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
43	42	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → 𝐹:𝐴⟶𝐵)
44		vex 3426	. . . . . . . 8 ⊢ 𝑥 ∈ V
45	17, 44	f1osn 6739	. . . . . . 7 ⊢ {⟨𝑧, 𝑥⟩}:{𝑧}–1-1-onto→{𝑥}
46		f1of 6700	. . . . . . 7 ⊢ ({⟨𝑧, 𝑥⟩}:{𝑧}–1-1-onto→{𝑥} → {⟨𝑧, 𝑥⟩}:{𝑧}⟶{𝑥})
47	45, 46	ax-mp 5	. . . . . 6 ⊢ {⟨𝑧, 𝑥⟩}:{𝑧}⟶{𝑥}
48		eldifi 4057	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐵 ∖ ran 𝐹) → 𝑥 ∈ 𝐵)
49	48	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → 𝑥 ∈ 𝐵)
50	49	snssd 4739	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → {𝑥} ⊆ 𝐵)
51		fss 6601	. . . . . 6 ⊢ (({⟨𝑧, 𝑥⟩}:{𝑧}⟶{𝑥} ∧ {𝑥} ⊆ 𝐵) → {⟨𝑧, 𝑥⟩}:{𝑧}⟶𝐵)
52	47, 50, 51	sylancr 586	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → {⟨𝑧, 𝑥⟩}:{𝑧}⟶𝐵)
53		res0 5884	. . . . . . 7 ⊢ (𝐹 ↾ ∅) = ∅
54		res0 5884	. . . . . . 7 ⊢ ({⟨𝑧, 𝑥⟩} ↾ ∅) = ∅
55	53, 54	eqtr4i 2769	. . . . . 6 ⊢ (𝐹 ↾ ∅) = ({⟨𝑧, 𝑥⟩} ↾ ∅)
56		disjsn 4644	. . . . . . . . 9 ⊢ ((𝐴 ∩ {𝑧}) = ∅ ↔ ¬ 𝑧 ∈ 𝐴)
57	22, 56	sylibr 233	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ∩ {𝑧}) = ∅)
58	57	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐴 ∩ {𝑧}) = ∅)
59	58	reseq2d 5880	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ↾ (𝐴 ∩ {𝑧})) = (𝐹 ↾ ∅))
60	58	reseq2d 5880	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ({⟨𝑧, 𝑥⟩} ↾ (𝐴 ∩ {𝑧})) = ({⟨𝑧, 𝑥⟩} ↾ ∅))
61	55, 59, 60	3eqtr4a 2805	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ↾ (𝐴 ∩ {𝑧})) = ({⟨𝑧, 𝑥⟩} ↾ (𝐴 ∩ {𝑧})))
62		fresaunres1 6631	. . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ {⟨𝑧, 𝑥⟩}:{𝑧}⟶𝐵 ∧ (𝐹 ↾ (𝐴 ∩ {𝑧})) = ({⟨𝑧, 𝑥⟩} ↾ (𝐴 ∩ {𝑧}))) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹)
63	43, 52, 61, 62	syl3anc 1369	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹)
64		f1f1orn 6711	. . . . . . . . 9 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴–1-1-onto→ran 𝐹)
65	40, 64	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→ran 𝐹)
66	65	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → 𝐹:𝐴–1-1-onto→ran 𝐹)
67	45	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → {⟨𝑧, 𝑥⟩}:{𝑧}–1-1-onto→{𝑥})
68		eldifn 4058	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐵 ∖ ran 𝐹) → ¬ 𝑥 ∈ ran 𝐹)
69	68	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ¬ 𝑥 ∈ ran 𝐹)
70		disjsn 4644	. . . . . . . 8 ⊢ ((ran 𝐹 ∩ {𝑥}) = ∅ ↔ ¬ 𝑥 ∈ ran 𝐹)
71	69, 70	sylibr 233	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (ran 𝐹 ∩ {𝑥}) = ∅)
72		f1oun 6719	. . . . . . 7 ⊢ (((𝐹:𝐴–1-1-onto→ran 𝐹 ∧ {⟨𝑧, 𝑥⟩}:{𝑧}–1-1-onto→{𝑥}) ∧ ((𝐴 ∩ {𝑧}) = ∅ ∧ (ran 𝐹 ∩ {𝑥}) = ∅)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}))
73	66, 67, 58, 71, 72	syl22anc 835	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}))
74		f1of1 6699	. . . . . 6 ⊢ ((𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→(ran 𝐹 ∪ {𝑥}))
75	73, 74	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→(ran 𝐹 ∪ {𝑥}))
76	43	frnd 6592	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ran 𝐹 ⊆ 𝐵)
77	76, 50	unssd 4116	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (ran 𝐹 ∪ {𝑥}) ⊆ 𝐵)
78		f1ss 6660	. . . . 5 ⊢ (((𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→(ran 𝐹 ∪ {𝑥}) ∧ (ran 𝐹 ∪ {𝑥}) ⊆ 𝐵) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)
79	75, 77, 78	syl2anc 583	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)
80		hashf1lem2.1	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ Fin)
81	42, 80	fexd 7085	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ V)
82	81	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → 𝐹 ∈ V)
83		snex 5349	. . . . . 6 ⊢ {⟨𝑧, 𝑥⟩} ∈ V
84		unexg 7577	. . . . . 6 ⊢ ((𝐹 ∈ V ∧ {⟨𝑧, 𝑥⟩} ∈ V) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ V)
85	82, 83, 84	sylancl 585	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ V)
86		reseq1 5874	. . . . . . . 8 ⊢ (𝑓 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) → (𝑓 ↾ 𝐴) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴))
87	86	eqeq1d 2740	. . . . . . 7 ⊢ (𝑓 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) → ((𝑓 ↾ 𝐴) = 𝐹 ↔ ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹))
88		f1eq1 6649	. . . . . . 7 ⊢ (𝑓 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) → (𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵 ↔ (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵))
89	87, 88	anbi12d 630	. . . . . 6 ⊢ (𝑓 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) → (((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵) ↔ (((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹 ∧ (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)))
90	89	elabg 3600	. . . . 5 ⊢ ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ V → ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ↔ (((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹 ∧ (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)))
91	85, 90	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ↔ (((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹 ∧ (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)))
92	63, 79, 91	mpbir2and 709	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)})
93	92	ex 412	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐵 ∖ ran 𝐹) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)}))
94	13	anbi1i 623	. . 3 ⊢ ((𝑔 ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) ↔ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)))
95		simprlr 776	. . . . . . 7 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)
96		f1fn 6655	. . . . . . 7 ⊢ (𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵 → 𝑔 Fn (𝐴 ∪ {𝑧}))
97	95, 96	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → 𝑔 Fn (𝐴 ∪ {𝑧}))
98	73	adantrl 712	. . . . . . 7 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}))
99		f1ofn 6701	. . . . . . 7 ⊢ ((𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) Fn (𝐴 ∪ {𝑧}))
100	98, 99	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) Fn (𝐴 ∪ {𝑧}))
101		eqfnfv 6891	. . . . . 6 ⊢ ((𝑔 Fn (𝐴 ∪ {𝑧}) ∧ (𝐹 ∪ {⟨𝑧, 𝑥⟩}) Fn (𝐴 ∪ {𝑧})) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ ∀𝑦 ∈ (𝐴 ∪ {𝑧})(𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦)))
102	97, 100, 101	syl2anc 583	. . . . 5 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ ∀𝑦 ∈ (𝐴 ∪ {𝑧})(𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦)))
103		fvres 6775	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝐴 → ((𝑔 ↾ 𝐴)‘𝑦) = (𝑔‘𝑦))
104	103	eqcomd 2744	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐴 → (𝑔‘𝑦) = ((𝑔 ↾ 𝐴)‘𝑦))
105		simprll 775	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝑔 ↾ 𝐴) = 𝐹)
106	105	fveq1d 6758	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ((𝑔 ↾ 𝐴)‘𝑦) = (𝐹‘𝑦))
107	104, 106	sylan9eqr 2801	. . . . . . . . 9 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → (𝑔‘𝑦) = (𝐹‘𝑦))
108	40	ad2antrr 722	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → 𝐹:𝐴–1-1→𝐵)
109		f1fn 6655	. . . . . . . . . . 11 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹 Fn 𝐴)
110	108, 109	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → 𝐹 Fn 𝐴)
111	17, 44	fnsn 6476	. . . . . . . . . . 11 ⊢ {⟨𝑧, 𝑥⟩} Fn {𝑧}
112	111	a1i 11	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → {⟨𝑧, 𝑥⟩} Fn {𝑧})
113	57	ad2antrr 722	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → (𝐴 ∩ {𝑧}) = ∅)
114		simpr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ 𝐴)
115	110, 112, 113, 114	fvun1d 6843	. . . . . . . . 9 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) = (𝐹‘𝑦))
116	107, 115	eqtr4d 2781	. . . . . . . 8 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦))
117	116	ralrimiva 3107	. . . . . . 7 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦))
118	117	biantrurd 532	. . . . . 6 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ∧ ∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦))))
119		ralunb 4121	. . . . . 6 ⊢ (∀𝑦 ∈ (𝐴 ∪ {𝑧})(𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ∧ ∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦)))
120	118, 119	bitr4di 288	. . . . 5 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ ∀𝑦 ∈ (𝐴 ∪ {𝑧})(𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦)))
121	42	fdmd 6595	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐹 = 𝐴)
122	121	eleq2d 2824	. . . . . . . . . 10 ⊢ (𝜑 → (𝑧 ∈ dom 𝐹 ↔ 𝑧 ∈ 𝐴))
123	22, 122	mtbird 324	. . . . . . . . 9 ⊢ (𝜑 → ¬ 𝑧 ∈ dom 𝐹)
124	123	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ¬ 𝑧 ∈ dom 𝐹)
125		fsnunfv 7041	. . . . . . . 8 ⊢ ((𝑧 ∈ V ∧ 𝑥 ∈ V ∧ ¬ 𝑧 ∈ dom 𝐹) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧) = 𝑥)
126	17, 44, 124, 125	mp3an12i 1463	. . . . . . 7 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧) = 𝑥)
127	126	eqeq2d 2749	. . . . . 6 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ((𝑔‘𝑧) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧) ↔ (𝑔‘𝑧) = 𝑥))
128		fveq2 6756	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → (𝑔‘𝑦) = (𝑔‘𝑧))
129		fveq2 6756	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧))
130	128, 129	eqeq12d 2754	. . . . . . 7 ⊢ (𝑦 = 𝑧 → ((𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ (𝑔‘𝑧) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧)))
131	17, 130	ralsn 4614	. . . . . 6 ⊢ (∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ (𝑔‘𝑧) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧))
132		eqcom 2745	. . . . . 6 ⊢ (𝑥 = (𝑔‘𝑧) ↔ (𝑔‘𝑧) = 𝑥)
133	127, 131, 132	3bitr4g 313	. . . . 5 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ 𝑥 = (𝑔‘𝑧)))
134	102, 120, 133	3bitr2d 306	. . . 4 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ 𝑥 = (𝑔‘𝑧)))
135	134	ex 412	. . 3 ⊢ (𝜑 → ((((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ 𝑥 = (𝑔‘𝑧))))
136	94, 135	syl5bi 241	. 2 ⊢ (𝜑 → ((𝑔 ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ 𝑥 = (𝑔‘𝑧))))
137	6, 7, 39, 93, 136	en3d 8732	1 ⊢ (𝜑 → {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ≈ (𝐵 ∖ ran 𝐹))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108  {cab 2715  ∀wral 3063  Vcvv 3422   ∖ cdif 3880   ∪ cun 3881   ∩ cin 3882   ⊆ wss 3883  ∅c0 4253  {csn 4558  ⟨cop 4564   class class class wbr 5070  dom cdm 5580  ran crn 5581   ↾ cres 5582   “ cima 5583   Fn wfn 6413  ⟶wf 6414  –1-1→wf1 6415  –1-1-onto→wf1o 6417  ‘cfv 6418  (class class class)co 7255   ≈ cen 8688  Fincfn 8691  1c1 10803   + caddc 10805   ≤ cle 10941  ♯chash 13972

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-map 8575  df-en 8692

This theorem is referenced by:  hashf1lem2  14098