Theorem actfunsnrndisj 32585

Description: The action 𝐹 of extending function from 𝐵 to 𝐶 with new values at point 𝐼 yields different functions. (Contributed by Thierry Arnoux, 9-Dec-2021.)

Hypotheses

Ref	Expression
actfunsn.1	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → 𝐴 ⊆ (𝐶 ↑m 𝐵))
actfunsn.2	⊢ (𝜑 → 𝐶 ∈ V)
actfunsn.3	⊢ (𝜑 → 𝐼 ∈ 𝑉)
actfunsn.4	⊢ (𝜑 → ¬ 𝐼 ∈ 𝐵)
actfunsn.5	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝑥 ∪ {⟨𝐼, 𝑘⟩}))

Assertion

Ref	Expression
actfunsnrndisj	⊢ (𝜑 → Disj 𝑘 ∈ 𝐶 ran 𝐹)

Distinct variable groups:   𝑥,𝐴   𝑘,𝐼,𝑥   𝜑,𝑘

Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑘)   𝐵(𝑥,𝑘)   𝐶(𝑥,𝑘)   𝐹(𝑥,𝑘)   𝑉(𝑥,𝑘)

Proof of Theorem actfunsnrndisj

Dummy variables 𝑧 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 485	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) ∧ 𝑓 = (𝑧 ∪ {⟨𝐼, 𝑘⟩})) → 𝑓 = (𝑧 ∪ {⟨𝐼, 𝑘⟩}))
2	1	fveq1d 6776	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) ∧ 𝑓 = (𝑧 ∪ {⟨𝐼, 𝑘⟩})) → (𝑓‘𝐼) = ((𝑧 ∪ {⟨𝐼, 𝑘⟩})‘𝐼))
3		actfunsn.1	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → 𝐴 ⊆ (𝐶 ↑m 𝐵))
4	3	ad2antrr 723	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) → 𝐴 ⊆ (𝐶 ↑m 𝐵))
5		simpr 485	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ 𝐴)
6	4, 5	sseldd 3922	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ (𝐶 ↑m 𝐵))
7		elmapfn 8653	. . . . . . . . . 10 ⊢ (𝑧 ∈ (𝐶 ↑m 𝐵) → 𝑧 Fn 𝐵)
8	6, 7	syl 17	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) → 𝑧 Fn 𝐵)
9		actfunsn.3	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
10	9	ad3antrrr 727	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) → 𝐼 ∈ 𝑉)
11		simpllr 773	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) → 𝑘 ∈ 𝐶)
12		fnsng 6486	. . . . . . . . . 10 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑘 ∈ 𝐶) → {⟨𝐼, 𝑘⟩} Fn {𝐼})
13	10, 11, 12	syl2anc 584	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) → {⟨𝐼, 𝑘⟩} Fn {𝐼})
14		actfunsn.4	. . . . . . . . . . 11 ⊢ (𝜑 → ¬ 𝐼 ∈ 𝐵)
15		disjsn 4647	. . . . . . . . . . 11 ⊢ ((𝐵 ∩ {𝐼}) = ∅ ↔ ¬ 𝐼 ∈ 𝐵)
16	14, 15	sylibr 233	. . . . . . . . . 10 ⊢ (𝜑 → (𝐵 ∩ {𝐼}) = ∅)
17	16	ad3antrrr 727	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) → (𝐵 ∩ {𝐼}) = ∅)
18		snidg 4595	. . . . . . . . . 10 ⊢ (𝐼 ∈ 𝑉 → 𝐼 ∈ {𝐼})
19	10, 18	syl 17	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) → 𝐼 ∈ {𝐼})
20		fvun2 6860	. . . . . . . . 9 ⊢ ((𝑧 Fn 𝐵 ∧ {⟨𝐼, 𝑘⟩} Fn {𝐼} ∧ ((𝐵 ∩ {𝐼}) = ∅ ∧ 𝐼 ∈ {𝐼})) → ((𝑧 ∪ {⟨𝐼, 𝑘⟩})‘𝐼) = ({⟨𝐼, 𝑘⟩}‘𝐼))
21	8, 13, 17, 19, 20	syl112anc 1373	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) → ((𝑧 ∪ {⟨𝐼, 𝑘⟩})‘𝐼) = ({⟨𝐼, 𝑘⟩}‘𝐼))
22		fvsng 7052	. . . . . . . . 9 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑘 ∈ 𝐶) → ({⟨𝐼, 𝑘⟩}‘𝐼) = 𝑘)
23	10, 11, 22	syl2anc 584	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) → ({⟨𝐼, 𝑘⟩}‘𝐼) = 𝑘)
24	21, 23	eqtrd 2778	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) → ((𝑧 ∪ {⟨𝐼, 𝑘⟩})‘𝐼) = 𝑘)
25	24	adantr 481	. . . . . 6 ⊢ (((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) ∧ 𝑓 = (𝑧 ∪ {⟨𝐼, 𝑘⟩})) → ((𝑧 ∪ {⟨𝐼, 𝑘⟩})‘𝐼) = 𝑘)
26	2, 25	eqtrd 2778	. . . . 5 ⊢ (((((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) ∧ 𝑧 ∈ 𝐴) ∧ 𝑓 = (𝑧 ∪ {⟨𝐼, 𝑘⟩})) → (𝑓‘𝐼) = 𝑘)
27		simpr 485	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) → 𝑓 ∈ ran 𝐹)
28		actfunsn.5	. . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝑥 ∪ {⟨𝐼, 𝑘⟩}))
29		uneq1 4090	. . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝑥 ∪ {⟨𝐼, 𝑘⟩}) = (𝑧 ∪ {⟨𝐼, 𝑘⟩}))
30	29	cbvmptv 5187	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 ↦ (𝑥 ∪ {⟨𝐼, 𝑘⟩})) = (𝑧 ∈ 𝐴 ↦ (𝑧 ∪ {⟨𝐼, 𝑘⟩}))
31	28, 30	eqtri 2766	. . . . . . 7 ⊢ 𝐹 = (𝑧 ∈ 𝐴 ↦ (𝑧 ∪ {⟨𝐼, 𝑘⟩}))
32		vex 3436	. . . . . . . 8 ⊢ 𝑧 ∈ V
33		snex 5354	. . . . . . . 8 ⊢ {⟨𝐼, 𝑘⟩} ∈ V
34	32, 33	unex 7596	. . . . . . 7 ⊢ (𝑧 ∪ {⟨𝐼, 𝑘⟩}) ∈ V
35	31, 34	elrnmpti 5869	. . . . . 6 ⊢ (𝑓 ∈ ran 𝐹 ↔ ∃𝑧 ∈ 𝐴 𝑓 = (𝑧 ∪ {⟨𝐼, 𝑘⟩}))
36	27, 35	sylib 217	. . . . 5 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) → ∃𝑧 ∈ 𝐴 𝑓 = (𝑧 ∪ {⟨𝐼, 𝑘⟩}))
37	26, 36	r19.29a 3218	. . . 4 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐶) ∧ 𝑓 ∈ ran 𝐹) → (𝑓‘𝐼) = 𝑘)
38	37	ralrimiva 3103	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → ∀𝑓 ∈ ran 𝐹(𝑓‘𝐼) = 𝑘)
39	38	ralrimiva 3103	. 2 ⊢ (𝜑 → ∀𝑘 ∈ 𝐶 ∀𝑓 ∈ ran 𝐹(𝑓‘𝐼) = 𝑘)
40		invdisj 5058	. 2 ⊢ (∀𝑘 ∈ 𝐶 ∀𝑓 ∈ ran 𝐹(𝑓‘𝐼) = 𝑘 → Disj 𝑘 ∈ 𝐶 ran 𝐹)
41	39, 40	syl 17	1 ⊢ (𝜑 → Disj 𝑘 ∈ 𝐶 ran 𝐹)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   = wceq 1539   ∈ wcel 2106  ∀wral 3064  ∃wrex 3065  Vcvv 3432   ∪ cun 3885   ∩ cin 3886   ⊆ wss 3887  ∅c0 4256  {csn 4561  ⟨cop 4567  Disj wdisj 5039   ↦ cmpt 5157  ran crn 5590   Fn wfn 6428  ‘cfv 6433  (class class class)co 7275   ↑_m cmap 8615

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rmo 3071  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-disj 5040  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-map 8617

This theorem is referenced by:  breprexplema  32610